./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 16:20:45,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 16:20:45,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 16:20:45,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 16:20:45,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 16:20:45,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 16:20:45,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 16:20:45,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 16:20:45,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 16:20:45,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 16:20:45,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 16:20:45,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 16:20:45,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 16:20:45,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 16:20:45,430 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 16:20:45,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 16:20:45,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 16:20:45,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 16:20:45,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 16:20:45,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 16:20:45,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 16:20:45,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 16:20:45,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 16:20:45,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 16:20:45,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 16:20:45,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 16:20:45,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 16:20:45,435 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 16:20:45,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 16:20:45,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 16:20:45,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 16:20:45,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 16:20:45,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:20:45,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 16:20:45,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 16:20:45,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 16:20:45,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 16:20:45,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 16:20:45,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 16:20:45,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 16:20:45,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 16:20:45,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 16:20:45,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2024-11-18 16:20:45,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 16:20:45,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 16:20:45,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 16:20:45,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 16:20:45,647 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 16:20:45,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-18 16:20:47,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 16:20:47,275 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 16:20:47,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-18 16:20:47,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae285fc4/d403314bed334cafb9aa25bc2830f539/FLAG05e06c11f [2024-11-18 16:20:47,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae285fc4/d403314bed334cafb9aa25bc2830f539 [2024-11-18 16:20:47,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 16:20:47,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 16:20:47,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 16:20:47,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 16:20:47,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 16:20:47,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2effd3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47, skipping insertion in model container [2024-11-18 16:20:47,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 16:20:47,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2024-11-18 16:20:47,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2024-11-18 16:20:47,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:20:47,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 16:20:47,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2024-11-18 16:20:47,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2024-11-18 16:20:47,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:20:47,682 INFO L204 MainTranslator]: Completed translation [2024-11-18 16:20:47,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47 WrapperNode [2024-11-18 16:20:47,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 16:20:47,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 16:20:47,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 16:20:47,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 16:20:47,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,768 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 506 [2024-11-18 16:20:47,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 16:20:47,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 16:20:47,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 16:20:47,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 16:20:47,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 16:20:47,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 16:20:47,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 16:20:47,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 16:20:47,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 16:20:47,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (1/1) ... [2024-11-18 16:20:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:20:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:20:47,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 16:20:47,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 16:20:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 16:20:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-18 16:20:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-18 16:20:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-18 16:20:47,956 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-18 16:20:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-18 16:20:47,956 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-18 16:20:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-18 16:20:47,956 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-18 16:20:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-18 16:20:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-18 16:20:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-18 16:20:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-18 16:20:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-18 16:20:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-18 16:20:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-18 16:20:47,958 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-18 16:20:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-18 16:20:47,958 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-18 16:20:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-18 16:20:47,958 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-18 16:20:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-18 16:20:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-18 16:20:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 16:20:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-18 16:20:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-18 16:20:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-18 16:20:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-18 16:20:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 16:20:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 16:20:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-18 16:20:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-18 16:20:48,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 16:20:48,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 16:20:48,657 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-18 16:20:48,661 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-18 16:20:48,783 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-11-18 16:20:48,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 16:20:48,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 16:20:48,816 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-18 16:20:48,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:20:48 BoogieIcfgContainer [2024-11-18 16:20:48,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 16:20:48,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 16:20:48,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 16:20:48,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 16:20:48,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:20:47" (1/3) ... [2024-11-18 16:20:48,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:20:48, skipping insertion in model container [2024-11-18 16:20:48,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:20:47" (2/3) ... [2024-11-18 16:20:48,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:20:48, skipping insertion in model container [2024-11-18 16:20:48,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:20:48" (3/3) ... [2024-11-18 16:20:48,833 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-18 16:20:48,861 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 16:20:48,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 16:20:48,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 16:20:48,980 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@121a0af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 16:20:48,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 16:20:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 203 states have (on average 1.5467980295566504) internal successors, (314), 209 states have internal predecessors, (314), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-18 16:20:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-18 16:20:49,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:49,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:49,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:49,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash -881887354, now seen corresponding path program 1 times [2024-11-18 16:20:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130427022] [2024-11-18 16:20:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130427022] [2024-11-18 16:20:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130427022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:49,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:49,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178775431] [2024-11-18 16:20:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:49,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:49,720 INFO L87 Difference]: Start difference. First operand has 252 states, 203 states have (on average 1.5467980295566504) internal successors, (314), 209 states have internal predecessors, (314), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:20:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:50,312 INFO L93 Difference]: Finished difference Result 605 states and 915 transitions. [2024-11-18 16:20:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:20:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-18 16:20:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:50,340 INFO L225 Difference]: With dead ends: 605 [2024-11-18 16:20:50,341 INFO L226 Difference]: Without dead ends: 361 [2024-11-18 16:20:50,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:50,352 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 320 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:50,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 818 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:20:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-18 16:20:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 354. [2024-11-18 16:20:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 285 states have (on average 1.4421052631578948) internal successors, (411), 291 states have internal predecessors, (411), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-18 16:20:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 504 transitions. [2024-11-18 16:20:50,464 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 504 transitions. Word has length 65 [2024-11-18 16:20:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:50,465 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 504 transitions. [2024-11-18 16:20:50,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:20:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 504 transitions. [2024-11-18 16:20:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-18 16:20:50,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:50,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:50,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 16:20:50,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash 797001286, now seen corresponding path program 1 times [2024-11-18 16:20:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:50,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107236202] [2024-11-18 16:20:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:50,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107236202] [2024-11-18 16:20:50,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107236202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:50,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:50,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:20:50,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867811760] [2024-11-18 16:20:50,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:50,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:20:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:20:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:20:50,578 INFO L87 Difference]: Start difference. First operand 354 states and 504 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 16:20:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:50,916 INFO L93 Difference]: Finished difference Result 955 states and 1352 transitions. [2024-11-18 16:20:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:20:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-18 16:20:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:50,928 INFO L225 Difference]: With dead ends: 955 [2024-11-18 16:20:50,932 INFO L226 Difference]: Without dead ends: 746 [2024-11-18 16:20:50,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:20:50,936 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 443 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:50,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 867 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:20:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-18 16:20:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 728. [2024-11-18 16:20:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 587 states have (on average 1.4088586030664396) internal successors, (827), 597 states have internal predecessors, (827), 85 states have call successors, (85), 49 states have call predecessors, (85), 54 states have return successors, (100), 84 states have call predecessors, (100), 83 states have call successors, (100) [2024-11-18 16:20:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1012 transitions. [2024-11-18 16:20:51,062 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1012 transitions. Word has length 65 [2024-11-18 16:20:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:51,062 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1012 transitions. [2024-11-18 16:20:51,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 16:20:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1012 transitions. [2024-11-18 16:20:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 16:20:51,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:51,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 16:20:51,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1040856949, now seen corresponding path program 1 times [2024-11-18 16:20:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678958748] [2024-11-18 16:20:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678958748] [2024-11-18 16:20:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678958748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:51,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:51,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282433978] [2024-11-18 16:20:51,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:51,295 INFO L87 Difference]: Start difference. First operand 728 states and 1012 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 16:20:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:51,416 INFO L93 Difference]: Finished difference Result 1326 states and 1848 transitions. [2024-11-18 16:20:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:20:51,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-18 16:20:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:51,425 INFO L225 Difference]: With dead ends: 1326 [2024-11-18 16:20:51,426 INFO L226 Difference]: Without dead ends: 743 [2024-11-18 16:20:51,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:51,432 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:51,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1709 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:20:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-18 16:20:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2024-11-18 16:20:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 599 states have (on average 1.3956594323873122) internal successors, (836), 609 states have internal predecessors, (836), 85 states have call successors, (85), 49 states have call predecessors, (85), 57 states have return successors, (105), 87 states have call predecessors, (105), 83 states have call successors, (105) [2024-11-18 16:20:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1026 transitions. [2024-11-18 16:20:51,506 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1026 transitions. Word has length 66 [2024-11-18 16:20:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:51,507 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1026 transitions. [2024-11-18 16:20:51,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 16:20:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1026 transitions. [2024-11-18 16:20:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 16:20:51,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:51,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:51,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 16:20:51,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:51,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash 11497651, now seen corresponding path program 1 times [2024-11-18 16:20:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:51,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335196907] [2024-11-18 16:20:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:51,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335196907] [2024-11-18 16:20:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335196907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:51,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:51,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481971510] [2024-11-18 16:20:51,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:51,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:51,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:51,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:51,677 INFO L87 Difference]: Start difference. First operand 743 states and 1026 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 16:20:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:52,433 INFO L93 Difference]: Finished difference Result 2438 states and 3364 transitions. [2024-11-18 16:20:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 16:20:52,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-18 16:20:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:52,443 INFO L225 Difference]: With dead ends: 2438 [2024-11-18 16:20:52,447 INFO L226 Difference]: Without dead ends: 942 [2024-11-18 16:20:52,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:52,457 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 1186 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:52,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1804 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 16:20:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-18 16:20:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 689. [2024-11-18 16:20:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 545 states have (on average 1.363302752293578) internal successors, (743), 555 states have internal predecessors, (743), 85 states have call successors, (85), 49 states have call predecessors, (85), 57 states have return successors, (97), 87 states have call predecessors, (97), 83 states have call successors, (97) [2024-11-18 16:20:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 925 transitions. [2024-11-18 16:20:52,570 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 925 transitions. Word has length 66 [2024-11-18 16:20:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:52,570 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 925 transitions. [2024-11-18 16:20:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 16:20:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 925 transitions. [2024-11-18 16:20:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-18 16:20:52,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:52,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:52,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 16:20:52,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1897393456, now seen corresponding path program 1 times [2024-11-18 16:20:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:52,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999913310] [2024-11-18 16:20:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:52,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:52,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999913310] [2024-11-18 16:20:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999913310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:52,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:52,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 16:20:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069998851] [2024-11-18 16:20:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:52,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 16:20:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 16:20:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:20:52,688 INFO L87 Difference]: Start difference. First operand 689 states and 925 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 16:20:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:53,472 INFO L93 Difference]: Finished difference Result 1503 states and 2009 transitions. [2024-11-18 16:20:53,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 16:20:53,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-18 16:20:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:53,474 INFO L225 Difference]: With dead ends: 1503 [2024-11-18 16:20:53,474 INFO L226 Difference]: Without dead ends: 131 [2024-11-18 16:20:53,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-18 16:20:53,477 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 710 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:53,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 934 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 16:20:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-18 16:20:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-18 16:20:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 109 states have internal predecessors, (157), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 16:20:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2024-11-18 16:20:53,484 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 67 [2024-11-18 16:20:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:53,485 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2024-11-18 16:20:53,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 16:20:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2024-11-18 16:20:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:53,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:53,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:53,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 16:20:53,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:53,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 554342333, now seen corresponding path program 1 times [2024-11-18 16:20:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939881196] [2024-11-18 16:20:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:53,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:53,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939881196] [2024-11-18 16:20:53,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939881196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:53,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863982502] [2024-11-18 16:20:53,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:53,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:53,540 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:53,870 INFO L93 Difference]: Finished difference Result 379 states and 553 transitions. [2024-11-18 16:20:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:20:53,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:53,872 INFO L225 Difference]: With dead ends: 379 [2024-11-18 16:20:53,873 INFO L226 Difference]: Without dead ends: 259 [2024-11-18 16:20:53,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:53,874 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 305 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:53,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 497 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:20:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-18 16:20:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2024-11-18 16:20:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 211 states have internal predecessors, (306), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2024-11-18 16:20:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 361 transitions. [2024-11-18 16:20:53,887 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 361 transitions. Word has length 68 [2024-11-18 16:20:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:53,887 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 361 transitions. [2024-11-18 16:20:53,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 361 transitions. [2024-11-18 16:20:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:53,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:53,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:53,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 16:20:53,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2081676353, now seen corresponding path program 1 times [2024-11-18 16:20:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397507989] [2024-11-18 16:20:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:53,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:53,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397507989] [2024-11-18 16:20:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397507989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351842988] [2024-11-18 16:20:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:53,970 INFO L87 Difference]: Start difference. First operand 250 states and 361 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:54,265 INFO L93 Difference]: Finished difference Result 634 states and 922 transitions. [2024-11-18 16:20:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:54,268 INFO L225 Difference]: With dead ends: 634 [2024-11-18 16:20:54,268 INFO L226 Difference]: Without dead ends: 395 [2024-11-18 16:20:54,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:54,269 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 295 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:54,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 913 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:20:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-18 16:20:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 362. [2024-11-18 16:20:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 303 states have (on average 1.4554455445544554) internal successors, (441), 306 states have internal predecessors, (441), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2024-11-18 16:20:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 521 transitions. [2024-11-18 16:20:54,286 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 521 transitions. Word has length 68 [2024-11-18 16:20:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:54,286 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 521 transitions. [2024-11-18 16:20:54,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 521 transitions. [2024-11-18 16:20:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:54,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:54,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:54,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 16:20:54,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:54,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1337271937, now seen corresponding path program 1 times [2024-11-18 16:20:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077795168] [2024-11-18 16:20:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:54,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077795168] [2024-11-18 16:20:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077795168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:54,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:54,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:54,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510840717] [2024-11-18 16:20:54,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:54,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:54,357 INFO L87 Difference]: Start difference. First operand 362 states and 521 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:54,523 INFO L93 Difference]: Finished difference Result 733 states and 1063 transitions. [2024-11-18 16:20:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:20:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:54,526 INFO L225 Difference]: With dead ends: 733 [2024-11-18 16:20:54,526 INFO L226 Difference]: Without dead ends: 382 [2024-11-18 16:20:54,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:54,530 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 223 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:54,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 336 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:20:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-18 16:20:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 362. [2024-11-18 16:20:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 303 states have (on average 1.4455445544554455) internal successors, (438), 306 states have internal predecessors, (438), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2024-11-18 16:20:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 518 transitions. [2024-11-18 16:20:54,562 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 518 transitions. Word has length 68 [2024-11-18 16:20:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 518 transitions. [2024-11-18 16:20:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 518 transitions. [2024-11-18 16:20:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:54,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:54,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 16:20:54,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash 201068093, now seen corresponding path program 1 times [2024-11-18 16:20:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138269755] [2024-11-18 16:20:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138269755] [2024-11-18 16:20:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138269755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:54,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:54,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176234104] [2024-11-18 16:20:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:54,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:54,665 INFO L87 Difference]: Start difference. First operand 362 states and 518 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:55,241 INFO L93 Difference]: Finished difference Result 986 states and 1413 transitions. [2024-11-18 16:20:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:55,249 INFO L225 Difference]: With dead ends: 986 [2024-11-18 16:20:55,249 INFO L226 Difference]: Without dead ends: 635 [2024-11-18 16:20:55,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:55,255 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 322 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:55,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 847 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:20:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-18 16:20:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 573. [2024-11-18 16:20:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 478 states have (on average 1.4330543933054394) internal successors, (685), 485 states have internal predecessors, (685), 58 states have call successors, (58), 30 states have call predecessors, (58), 36 states have return successors, (74), 61 states have call predecessors, (74), 58 states have call successors, (74) [2024-11-18 16:20:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 817 transitions. [2024-11-18 16:20:55,327 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 817 transitions. Word has length 68 [2024-11-18 16:20:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:55,328 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 817 transitions. [2024-11-18 16:20:55,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 817 transitions. [2024-11-18 16:20:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:55,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:55,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:55,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 16:20:55,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1827518017, now seen corresponding path program 1 times [2024-11-18 16:20:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148353171] [2024-11-18 16:20:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:55,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148353171] [2024-11-18 16:20:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148353171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063677111] [2024-11-18 16:20:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:55,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:55,470 INFO L87 Difference]: Start difference. First operand 573 states and 817 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:56,121 INFO L93 Difference]: Finished difference Result 1625 states and 2324 transitions. [2024-11-18 16:20:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:56,125 INFO L225 Difference]: With dead ends: 1625 [2024-11-18 16:20:56,126 INFO L226 Difference]: Without dead ends: 1063 [2024-11-18 16:20:56,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:56,128 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 277 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:56,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 839 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:20:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-11-18 16:20:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1008. [2024-11-18 16:20:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 837 states have (on average 1.4205495818399043) internal successors, (1189), 858 states have internal predecessors, (1189), 96 states have call successors, (96), 54 states have call predecessors, (96), 74 states have return successors, (160), 103 states have call predecessors, (160), 96 states have call successors, (160) [2024-11-18 16:20:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1445 transitions. [2024-11-18 16:20:56,195 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1445 transitions. Word has length 68 [2024-11-18 16:20:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:56,195 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1445 transitions. [2024-11-18 16:20:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1445 transitions. [2024-11-18 16:20:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:56,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:56,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 16:20:56,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1986369021, now seen corresponding path program 1 times [2024-11-18 16:20:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183978776] [2024-11-18 16:20:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183978776] [2024-11-18 16:20:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183978776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:56,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109179687] [2024-11-18 16:20:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:56,247 INFO L87 Difference]: Start difference. First operand 1008 states and 1445 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:56,296 INFO L93 Difference]: Finished difference Result 2031 states and 2947 transitions. [2024-11-18 16:20:56,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:20:56,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:56,302 INFO L225 Difference]: With dead ends: 2031 [2024-11-18 16:20:56,303 INFO L226 Difference]: Without dead ends: 1035 [2024-11-18 16:20:56,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:56,307 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:56,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 734 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:20:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-18 16:20:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2024-11-18 16:20:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 864 states have (on average 1.4074074074074074) internal successors, (1216), 885 states have internal predecessors, (1216), 96 states have call successors, (96), 54 states have call predecessors, (96), 74 states have return successors, (160), 103 states have call predecessors, (160), 96 states have call successors, (160) [2024-11-18 16:20:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1472 transitions. [2024-11-18 16:20:56,392 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1472 transitions. Word has length 68 [2024-11-18 16:20:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:56,392 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1472 transitions. [2024-11-18 16:20:56,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1472 transitions. [2024-11-18 16:20:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:56,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:56,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:56,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 16:20:56,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1884951553, now seen corresponding path program 1 times [2024-11-18 16:20:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:56,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070072356] [2024-11-18 16:20:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:56,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070072356] [2024-11-18 16:20:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070072356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:56,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:56,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:20:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283270828] [2024-11-18 16:20:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:56,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:20:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:20:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:20:56,441 INFO L87 Difference]: Start difference. First operand 1035 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:56,666 INFO L93 Difference]: Finished difference Result 3047 states and 4358 transitions. [2024-11-18 16:20:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:20:56,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:56,675 INFO L225 Difference]: With dead ends: 3047 [2024-11-18 16:20:56,675 INFO L226 Difference]: Without dead ends: 2024 [2024-11-18 16:20:56,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:20:56,678 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 321 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:56,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 617 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:20:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2024-11-18 16:20:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2004. [2024-11-18 16:20:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1672 states have (on average 1.3977272727272727) internal successors, (2337), 1713 states have internal predecessors, (2337), 183 states have call successors, (183), 108 states have call predecessors, (183), 148 states have return successors, (304), 190 states have call predecessors, (304), 183 states have call successors, (304) [2024-11-18 16:20:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2824 transitions. [2024-11-18 16:20:56,814 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2824 transitions. Word has length 68 [2024-11-18 16:20:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:56,814 INFO L471 AbstractCegarLoop]: Abstraction has 2004 states and 2824 transitions. [2024-11-18 16:20:56,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2824 transitions. [2024-11-18 16:20:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:56,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:56,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 16:20:56,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1453087360, now seen corresponding path program 1 times [2024-11-18 16:20:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380352309] [2024-11-18 16:20:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380352309] [2024-11-18 16:20:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380352309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:56,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808223765] [2024-11-18 16:20:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:56,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:56,893 INFO L87 Difference]: Start difference. First operand 2004 states and 2824 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:57,042 INFO L93 Difference]: Finished difference Result 4023 states and 5738 transitions. [2024-11-18 16:20:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:20:57,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:57,052 INFO L225 Difference]: With dead ends: 4023 [2024-11-18 16:20:57,052 INFO L226 Difference]: Without dead ends: 2031 [2024-11-18 16:20:57,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:57,057 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:57,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 734 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:20:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-11-18 16:20:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2024-11-18 16:20:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 1699 states have (on average 1.3861094761624484) internal successors, (2355), 1740 states have internal predecessors, (2355), 183 states have call successors, (183), 108 states have call predecessors, (183), 148 states have return successors, (304), 190 states have call predecessors, (304), 183 states have call successors, (304) [2024-11-18 16:20:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2842 transitions. [2024-11-18 16:20:57,232 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2842 transitions. Word has length 68 [2024-11-18 16:20:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:57,233 INFO L471 AbstractCegarLoop]: Abstraction has 2031 states and 2842 transitions. [2024-11-18 16:20:57,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2842 transitions. [2024-11-18 16:20:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:57,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:57,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:57,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 16:20:57,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:57,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash 609081858, now seen corresponding path program 1 times [2024-11-18 16:20:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502826866] [2024-11-18 16:20:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502826866] [2024-11-18 16:20:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502826866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:57,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:57,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437430850] [2024-11-18 16:20:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:57,294 INFO L87 Difference]: Start difference. First operand 2031 states and 2842 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:57,438 INFO L93 Difference]: Finished difference Result 4104 states and 5810 transitions. [2024-11-18 16:20:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:20:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:57,450 INFO L225 Difference]: With dead ends: 4104 [2024-11-18 16:20:57,451 INFO L226 Difference]: Without dead ends: 2085 [2024-11-18 16:20:57,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:57,455 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:57,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 734 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:20:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2024-11-18 16:20:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2085. [2024-11-18 16:20:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 1753 states have (on average 1.374215630347975) internal successors, (2409), 1794 states have internal predecessors, (2409), 183 states have call successors, (183), 108 states have call predecessors, (183), 148 states have return successors, (304), 190 states have call predecessors, (304), 183 states have call successors, (304) [2024-11-18 16:20:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2896 transitions. [2024-11-18 16:20:57,571 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2896 transitions. Word has length 68 [2024-11-18 16:20:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 2896 transitions. [2024-11-18 16:20:57,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2896 transitions. [2024-11-18 16:20:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:57,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:57,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 16:20:57,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1995285252, now seen corresponding path program 1 times [2024-11-18 16:20:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093547410] [2024-11-18 16:20:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093547410] [2024-11-18 16:20:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093547410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:57,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:57,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57681570] [2024-11-18 16:20:57,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:57,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:57,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:57,810 INFO L87 Difference]: Start difference. First operand 2085 states and 2896 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:58,235 INFO L93 Difference]: Finished difference Result 2665 states and 3708 transitions. [2024-11-18 16:20:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:58,245 INFO L225 Difference]: With dead ends: 2665 [2024-11-18 16:20:58,249 INFO L226 Difference]: Without dead ends: 1459 [2024-11-18 16:20:58,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:58,252 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 287 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:58,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 623 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:20:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-11-18 16:20:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1367. [2024-11-18 16:20:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1156 states have (on average 1.3641868512110726) internal successors, (1577), 1169 states have internal predecessors, (1577), 126 states have call successors, (126), 72 states have call predecessors, (126), 84 states have return successors, (155), 129 states have call predecessors, (155), 126 states have call successors, (155) [2024-11-18 16:20:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1858 transitions. [2024-11-18 16:20:58,447 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1858 transitions. Word has length 68 [2024-11-18 16:20:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 1858 transitions. [2024-11-18 16:20:58,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1858 transitions. [2024-11-18 16:20:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:58,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:58,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:58,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 16:20:58,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1861271746, now seen corresponding path program 1 times [2024-11-18 16:20:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407959668] [2024-11-18 16:20:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407959668] [2024-11-18 16:20:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407959668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:58,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:20:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410955364] [2024-11-18 16:20:58,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:58,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:20:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:58,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:20:58,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:20:58,534 INFO L87 Difference]: Start difference. First operand 1367 states and 1858 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:58,773 INFO L93 Difference]: Finished difference Result 3355 states and 4550 transitions. [2024-11-18 16:20:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:20:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:58,781 INFO L225 Difference]: With dead ends: 3355 [2024-11-18 16:20:58,781 INFO L226 Difference]: Without dead ends: 2000 [2024-11-18 16:20:58,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:20:58,784 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 264 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:58,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 323 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:20:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-18 16:20:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1718. [2024-11-18 16:20:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1477 states have (on average 1.3175355450236967) internal successors, (1946), 1490 states have internal predecessors, (1946), 135 states have call successors, (135), 93 states have call predecessors, (135), 105 states have return successors, (185), 138 states have call predecessors, (185), 135 states have call successors, (185) [2024-11-18 16:20:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2266 transitions. [2024-11-18 16:20:58,901 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2266 transitions. Word has length 68 [2024-11-18 16:20:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2266 transitions. [2024-11-18 16:20:58,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2266 transitions. [2024-11-18 16:20:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:58,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:58,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:58,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 16:20:58,903 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:58,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2080126464, now seen corresponding path program 1 times [2024-11-18 16:20:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590044387] [2024-11-18 16:20:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590044387] [2024-11-18 16:20:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590044387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:59,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260292912] [2024-11-18 16:20:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:59,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:59,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:59,080 INFO L87 Difference]: Start difference. First operand 1718 states and 2266 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:20:59,554 INFO L93 Difference]: Finished difference Result 3045 states and 4022 transitions. [2024-11-18 16:20:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:20:59,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:20:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:20:59,564 INFO L225 Difference]: With dead ends: 3045 [2024-11-18 16:20:59,565 INFO L226 Difference]: Without dead ends: 1860 [2024-11-18 16:20:59,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:20:59,569 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 279 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 16:20:59,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 591 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 16:20:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-18 16:20:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1702. [2024-11-18 16:20:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1467 states have (on average 1.3142467620995228) internal successors, (1928), 1474 states have internal predecessors, (1928), 135 states have call successors, (135), 93 states have call predecessors, (135), 99 states have return successors, (167), 136 states have call predecessors, (167), 135 states have call successors, (167) [2024-11-18 16:20:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2230 transitions. [2024-11-18 16:20:59,723 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2230 transitions. Word has length 68 [2024-11-18 16:20:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:20:59,723 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2230 transitions. [2024-11-18 16:20:59,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:20:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2230 transitions. [2024-11-18 16:20:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:20:59,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:20:59,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:20:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 16:20:59,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:20:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:20:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1792139006, now seen corresponding path program 1 times [2024-11-18 16:20:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:20:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128752933] [2024-11-18 16:20:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:20:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:20:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:20:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:20:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:20:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128752933] [2024-11-18 16:20:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128752933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:20:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:20:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:20:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375477532] [2024-11-18 16:20:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:20:59,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:20:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:20:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:20:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:20:59,828 INFO L87 Difference]: Start difference. First operand 1702 states and 2230 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:21:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:00,153 INFO L93 Difference]: Finished difference Result 2698 states and 3537 transitions. [2024-11-18 16:21:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:21:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-18 16:21:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:00,160 INFO L225 Difference]: With dead ends: 2698 [2024-11-18 16:21:00,162 INFO L226 Difference]: Without dead ends: 1541 [2024-11-18 16:21:00,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:21:00,167 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 268 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:00,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 578 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:21:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-18 16:21:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1439. [2024-11-18 16:21:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1243 states have (on average 1.3169750603378922) internal successors, (1637), 1246 states have internal predecessors, (1637), 115 states have call successors, (115), 78 states have call predecessors, (115), 80 states have return successors, (135), 115 states have call predecessors, (135), 115 states have call successors, (135) [2024-11-18 16:21:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1887 transitions. [2024-11-18 16:21:00,235 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1887 transitions. Word has length 68 [2024-11-18 16:21:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:00,235 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1887 transitions. [2024-11-18 16:21:00,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:21:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1887 transitions. [2024-11-18 16:21:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:21:00,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:00,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:00,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 16:21:00,236 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:00,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1685179840, now seen corresponding path program 1 times [2024-11-18 16:21:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993137654] [2024-11-18 16:21:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:21:00,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:00,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993137654] [2024-11-18 16:21:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993137654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:00,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:21:00,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079868655] [2024-11-18 16:21:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:00,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:00,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:00,268 INFO L87 Difference]: Start difference. First operand 1439 states and 1887 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-18 16:21:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:00,433 INFO L93 Difference]: Finished difference Result 3529 states and 4670 transitions. [2024-11-18 16:21:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2024-11-18 16:21:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:00,447 INFO L225 Difference]: With dead ends: 3529 [2024-11-18 16:21:00,447 INFO L226 Difference]: Without dead ends: 2102 [2024-11-18 16:21:00,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:00,453 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 153 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:00,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 345 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2024-11-18 16:21:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2095. [2024-11-18 16:21:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 1805 states have (on average 1.3074792243767313) internal successors, (2360), 1817 states have internal predecessors, (2360), 169 states have call successors, (169), 116 states have call predecessors, (169), 120 states have return successors, (187), 162 states have call predecessors, (187), 169 states have call successors, (187) [2024-11-18 16:21:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2716 transitions. [2024-11-18 16:21:00,588 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2716 transitions. Word has length 68 [2024-11-18 16:21:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:00,588 INFO L471 AbstractCegarLoop]: Abstraction has 2095 states and 2716 transitions. [2024-11-18 16:21:00,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-18 16:21:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2716 transitions. [2024-11-18 16:21:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 16:21:00,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:00,590 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:00,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-18 16:21:00,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -997809819, now seen corresponding path program 1 times [2024-11-18 16:21:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610296470] [2024-11-18 16:21:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 16:21:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610296470] [2024-11-18 16:21:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610296470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:21:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467233660] [2024-11-18 16:21:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:21:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:00,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:21:00,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:00,684 INFO L87 Difference]: Start difference. First operand 2095 states and 2716 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 16:21:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:01,214 INFO L93 Difference]: Finished difference Result 6425 states and 8390 transitions. [2024-11-18 16:21:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:21:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 111 [2024-11-18 16:21:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:01,241 INFO L225 Difference]: With dead ends: 6425 [2024-11-18 16:21:01,241 INFO L226 Difference]: Without dead ends: 4343 [2024-11-18 16:21:01,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:21:01,252 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 232 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:01,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 410 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:21:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2024-11-18 16:21:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4321. [2024-11-18 16:21:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4321 states, 3717 states have (on average 1.2937853107344632) internal successors, (4809), 3759 states have internal predecessors, (4809), 330 states have call successors, (330), 231 states have call predecessors, (330), 273 states have return successors, (464), 332 states have call predecessors, (464), 330 states have call successors, (464) [2024-11-18 16:21:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5603 transitions. [2024-11-18 16:21:01,599 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5603 transitions. Word has length 111 [2024-11-18 16:21:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:01,599 INFO L471 AbstractCegarLoop]: Abstraction has 4321 states and 5603 transitions. [2024-11-18 16:21:01,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 16:21:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5603 transitions. [2024-11-18 16:21:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 16:21:01,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:01,605 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:01,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-18 16:21:01,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:01,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1430448803, now seen corresponding path program 1 times [2024-11-18 16:21:01,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112889800] [2024-11-18 16:21:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-18 16:21:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112889800] [2024-11-18 16:21:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112889800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:21:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444279296] [2024-11-18 16:21:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:01,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:01,643 INFO L87 Difference]: Start difference. First operand 4321 states and 5603 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:21:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:01,802 INFO L93 Difference]: Finished difference Result 7807 states and 10111 transitions. [2024-11-18 16:21:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 111 [2024-11-18 16:21:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:01,816 INFO L225 Difference]: With dead ends: 7807 [2024-11-18 16:21:01,816 INFO L226 Difference]: Without dead ends: 3499 [2024-11-18 16:21:01,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:01,827 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 178 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:01,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 185 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2024-11-18 16:21:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3499. [2024-11-18 16:21:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3017 states have (on average 1.293006297646669) internal successors, (3901), 3053 states have internal predecessors, (3901), 259 states have call successors, (259), 182 states have call predecessors, (259), 222 states have return successors, (367), 264 states have call predecessors, (367), 259 states have call successors, (367) [2024-11-18 16:21:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4527 transitions. [2024-11-18 16:21:02,380 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4527 transitions. Word has length 111 [2024-11-18 16:21:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:02,384 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 4527 transitions. [2024-11-18 16:21:02,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:21:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4527 transitions. [2024-11-18 16:21:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 16:21:02,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:02,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:02,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-18 16:21:02,393 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1804883072, now seen corresponding path program 1 times [2024-11-18 16:21:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121163463] [2024-11-18 16:21:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 16:21:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121163463] [2024-11-18 16:21:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121163463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:02,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:21:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637584417] [2024-11-18 16:21:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:02,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:21:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:21:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:02,485 INFO L87 Difference]: Start difference. First operand 3499 states and 4527 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 16:21:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:02,951 INFO L93 Difference]: Finished difference Result 9785 states and 12715 transitions. [2024-11-18 16:21:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:21:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 113 [2024-11-18 16:21:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:02,977 INFO L225 Difference]: With dead ends: 9785 [2024-11-18 16:21:02,978 INFO L226 Difference]: Without dead ends: 6299 [2024-11-18 16:21:02,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:21:02,985 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 213 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:02,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:21:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6299 states. [2024-11-18 16:21:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6299 to 6111. [2024-11-18 16:21:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6111 states, 5185 states have (on average 1.289103182256509) internal successors, (6684), 5286 states have internal predecessors, (6684), 473 states have call successors, (473), 320 states have call predecessors, (473), 452 states have return successors, (809), 506 states have call predecessors, (809), 473 states have call successors, (809) [2024-11-18 16:21:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 7966 transitions. [2024-11-18 16:21:03,323 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 7966 transitions. Word has length 113 [2024-11-18 16:21:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:03,324 INFO L471 AbstractCegarLoop]: Abstraction has 6111 states and 7966 transitions. [2024-11-18 16:21:03,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 16:21:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 7966 transitions. [2024-11-18 16:21:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 16:21:03,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:03,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:03,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-18 16:21:03,326 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:03,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash -228510974, now seen corresponding path program 1 times [2024-11-18 16:21:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344739088] [2024-11-18 16:21:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-18 16:21:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344739088] [2024-11-18 16:21:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344739088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:03,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:03,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:21:03,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462249807] [2024-11-18 16:21:03,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:03,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:03,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:03,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:03,358 INFO L87 Difference]: Start difference. First operand 6111 states and 7966 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:21:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:03,608 INFO L93 Difference]: Finished difference Result 12206 states and 15907 transitions. [2024-11-18 16:21:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 113 [2024-11-18 16:21:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:03,630 INFO L225 Difference]: With dead ends: 12206 [2024-11-18 16:21:03,631 INFO L226 Difference]: Without dead ends: 6107 [2024-11-18 16:21:03,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:03,643 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 176 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:03,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 184 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6107 states. [2024-11-18 16:21:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6107 to 6107. [2024-11-18 16:21:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6107 states, 5184 states have (on average 1.288966049382716) internal successors, (6682), 5284 states have internal predecessors, (6682), 470 states have call successors, (470), 320 states have call predecessors, (470), 452 states have return successors, (805), 503 states have call predecessors, (805), 470 states have call successors, (805) [2024-11-18 16:21:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6107 states to 6107 states and 7957 transitions. [2024-11-18 16:21:03,975 INFO L78 Accepts]: Start accepts. Automaton has 6107 states and 7957 transitions. Word has length 113 [2024-11-18 16:21:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:03,975 INFO L471 AbstractCegarLoop]: Abstraction has 6107 states and 7957 transitions. [2024-11-18 16:21:03,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:21:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6107 states and 7957 transitions. [2024-11-18 16:21:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-18 16:21:03,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:03,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:03,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-18 16:21:03,978 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:03,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 664171685, now seen corresponding path program 1 times [2024-11-18 16:21:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:03,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918491034] [2024-11-18 16:21:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-18 16:21:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918491034] [2024-11-18 16:21:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918491034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:04,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 16:21:04,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776376475] [2024-11-18 16:21:04,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:04,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 16:21:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:04,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 16:21:04,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:21:04,053 INFO L87 Difference]: Start difference. First operand 6107 states and 7957 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 16:21:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:05,577 INFO L93 Difference]: Finished difference Result 17627 states and 23273 transitions. [2024-11-18 16:21:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 16:21:05,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 115 [2024-11-18 16:21:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:05,613 INFO L225 Difference]: With dead ends: 17627 [2024-11-18 16:21:05,613 INFO L226 Difference]: Without dead ends: 9307 [2024-11-18 16:21:05,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-18 16:21:05,640 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1185 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:05,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 982 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:21:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2024-11-18 16:21:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 9143. [2024-11-18 16:21:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9143 states, 7799 states have (on average 1.270675727657392) internal successors, (9910), 7944 states have internal predecessors, (9910), 668 states have call successors, (668), 474 states have call predecessors, (668), 675 states have return successors, (1114), 725 states have call predecessors, (1114), 668 states have call successors, (1114) [2024-11-18 16:21:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 11692 transitions. [2024-11-18 16:21:06,192 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 11692 transitions. Word has length 115 [2024-11-18 16:21:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:06,193 INFO L471 AbstractCegarLoop]: Abstraction has 9143 states and 11692 transitions. [2024-11-18 16:21:06,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 16:21:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 11692 transitions. [2024-11-18 16:21:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 16:21:06,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:06,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:06,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-18 16:21:06,199 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:06,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:06,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1089789147, now seen corresponding path program 1 times [2024-11-18 16:21:06,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104849087] [2024-11-18 16:21:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-18 16:21:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104849087] [2024-11-18 16:21:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104849087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:21:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951042292] [2024-11-18 16:21:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:06,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:06,242 INFO L87 Difference]: Start difference. First operand 9143 states and 11692 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 16:21:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:06,867 INFO L93 Difference]: Finished difference Result 20748 states and 26522 transitions. [2024-11-18 16:21:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:06,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2024-11-18 16:21:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:06,913 INFO L225 Difference]: With dead ends: 20748 [2024-11-18 16:21:06,913 INFO L226 Difference]: Without dead ends: 11617 [2024-11-18 16:21:06,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:21:06,935 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 127 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:06,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 342 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11617 states. [2024-11-18 16:21:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11617 to 11545. [2024-11-18 16:21:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11545 states, 9847 states have (on average 1.259672996851833) internal successors, (12404), 10010 states have internal predecessors, (12404), 862 states have call successors, (862), 612 states have call predecessors, (862), 835 states have return successors, (1350), 923 states have call predecessors, (1350), 862 states have call successors, (1350) [2024-11-18 16:21:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11545 states to 11545 states and 14616 transitions. [2024-11-18 16:21:07,626 INFO L78 Accepts]: Start accepts. Automaton has 11545 states and 14616 transitions. Word has length 146 [2024-11-18 16:21:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 11545 states and 14616 transitions. [2024-11-18 16:21:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 16:21:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 11545 states and 14616 transitions. [2024-11-18 16:21:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-18 16:21:07,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:07,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:07,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-18 16:21:07,636 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:07,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash 551416306, now seen corresponding path program 1 times [2024-11-18 16:21:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768572150] [2024-11-18 16:21:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:07,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-18 16:21:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768572150] [2024-11-18 16:21:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768572150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:21:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945366479] [2024-11-18 16:21:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:21:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:21:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:21:07,713 INFO L87 Difference]: Start difference. First operand 11545 states and 14616 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-18 16:21:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:09,360 INFO L93 Difference]: Finished difference Result 21146 states and 26885 transitions. [2024-11-18 16:21:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 16:21:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 167 [2024-11-18 16:21:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:09,414 INFO L225 Difference]: With dead ends: 21146 [2024-11-18 16:21:09,414 INFO L226 Difference]: Without dead ends: 12016 [2024-11-18 16:21:09,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-18 16:21:09,434 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 652 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:09,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 876 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 16:21:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12016 states. [2024-11-18 16:21:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12016 to 11545. [2024-11-18 16:21:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11545 states, 9847 states have (on average 1.2559155072610948) internal successors, (12367), 10010 states have internal predecessors, (12367), 862 states have call successors, (862), 612 states have call predecessors, (862), 835 states have return successors, (1338), 923 states have call predecessors, (1338), 862 states have call successors, (1338) [2024-11-18 16:21:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11545 states to 11545 states and 14567 transitions. [2024-11-18 16:21:10,363 INFO L78 Accepts]: Start accepts. Automaton has 11545 states and 14567 transitions. Word has length 167 [2024-11-18 16:21:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:10,364 INFO L471 AbstractCegarLoop]: Abstraction has 11545 states and 14567 transitions. [2024-11-18 16:21:10,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-18 16:21:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11545 states and 14567 transitions. [2024-11-18 16:21:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-18 16:21:10,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:10,372 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:10,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-18 16:21:10,372 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:10,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 300530536, now seen corresponding path program 1 times [2024-11-18 16:21:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622912113] [2024-11-18 16:21:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-18 16:21:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622912113] [2024-11-18 16:21:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622912113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921023851] [2024-11-18 16:21:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:10,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:10,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 16:21:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:10,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:21:10,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-18 16:21:10,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921023851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-11-18 16:21:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118615227] [2024-11-18 16:21:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:10,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:21:10,711 INFO L87 Difference]: Start difference. First operand 11545 states and 14567 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-18 16:21:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:11,608 INFO L93 Difference]: Finished difference Result 23158 states and 30012 transitions. [2024-11-18 16:21:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 168 [2024-11-18 16:21:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:11,653 INFO L225 Difference]: With dead ends: 23158 [2024-11-18 16:21:11,653 INFO L226 Difference]: Without dead ends: 12229 [2024-11-18 16:21:11,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:21:11,674 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 130 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:11,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 229 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12229 states. [2024-11-18 16:21:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12229 to 12163. [2024-11-18 16:21:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12163 states, 10455 states have (on average 1.2419894787183166) internal successors, (12985), 10601 states have internal predecessors, (12985), 876 states have call successors, (876), 656 states have call predecessors, (876), 831 states have return successors, (1403), 906 states have call predecessors, (1403), 876 states have call successors, (1403) [2024-11-18 16:21:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12163 states to 12163 states and 15264 transitions. [2024-11-18 16:21:12,551 INFO L78 Accepts]: Start accepts. Automaton has 12163 states and 15264 transitions. Word has length 168 [2024-11-18 16:21:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:12,552 INFO L471 AbstractCegarLoop]: Abstraction has 12163 states and 15264 transitions. [2024-11-18 16:21:12,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-18 16:21:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 12163 states and 15264 transitions. [2024-11-18 16:21:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-18 16:21:12,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:12,591 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:12,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 16:21:12,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-18 16:21:12,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:12,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1634694218, now seen corresponding path program 1 times [2024-11-18 16:21:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:12,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346427457] [2024-11-18 16:21:12,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-18 16:21:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:12,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346427457] [2024-11-18 16:21:12,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346427457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596759667] [2024-11-18 16:21:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:12,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:12,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:12,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:12,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 16:21:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:13,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:21:13,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-18 16:21:13,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596759667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:13,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-18 16:21:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534726187] [2024-11-18 16:21:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:13,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:21:13,120 INFO L87 Difference]: Start difference. First operand 12163 states and 15264 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-18 16:21:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:13,764 INFO L93 Difference]: Finished difference Result 23575 states and 30299 transitions. [2024-11-18 16:21:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 202 [2024-11-18 16:21:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:13,808 INFO L225 Difference]: With dead ends: 23575 [2024-11-18 16:21:13,808 INFO L226 Difference]: Without dead ends: 11642 [2024-11-18 16:21:13,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:21:13,833 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 132 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:13,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2024-11-18 16:21:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 11626. [2024-11-18 16:21:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11626 states, 9975 states have (on average 1.2) internal successors, (11970), 10057 states have internal predecessors, (11970), 876 states have call successors, (876), 672 states have call predecessors, (876), 774 states have return successors, (1212), 897 states have call predecessors, (1212), 876 states have call successors, (1212) [2024-11-18 16:21:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11626 states to 11626 states and 14058 transitions. [2024-11-18 16:21:14,600 INFO L78 Accepts]: Start accepts. Automaton has 11626 states and 14058 transitions. Word has length 202 [2024-11-18 16:21:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 11626 states and 14058 transitions. [2024-11-18 16:21:14,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-18 16:21:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 11626 states and 14058 transitions. [2024-11-18 16:21:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-18 16:21:14,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:14,611 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:14,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 16:21:14,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-18 16:21:14,812 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:14,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash -430196228, now seen corresponding path program 1 times [2024-11-18 16:21:14,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:14,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133019131] [2024-11-18 16:21:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:14,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-18 16:21:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133019131] [2024-11-18 16:21:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133019131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992198534] [2024-11-18 16:21:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:14,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:14,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:14,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 16:21:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:15,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:21:15,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-18 16:21:15,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992198534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:15,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-18 16:21:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221839524] [2024-11-18 16:21:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:15,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:21:15,098 INFO L87 Difference]: Start difference. First operand 11626 states and 14058 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 16:21:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:15,934 INFO L93 Difference]: Finished difference Result 18719 states and 22627 transitions. [2024-11-18 16:21:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 202 [2024-11-18 16:21:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:15,977 INFO L225 Difference]: With dead ends: 18719 [2024-11-18 16:21:15,977 INFO L226 Difference]: Without dead ends: 10003 [2024-11-18 16:21:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:21:15,996 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 134 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:15,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 430 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10003 states. [2024-11-18 16:21:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10003 to 9911. [2024-11-18 16:21:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9911 states, 8556 states have (on average 1.1992753623188406) internal successors, (10261), 8632 states have internal predecessors, (10261), 704 states have call successors, (704), 557 states have call predecessors, (704), 650 states have return successors, (941), 722 states have call predecessors, (941), 704 states have call successors, (941) [2024-11-18 16:21:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9911 states to 9911 states and 11906 transitions. [2024-11-18 16:21:16,837 INFO L78 Accepts]: Start accepts. Automaton has 9911 states and 11906 transitions. Word has length 202 [2024-11-18 16:21:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:16,838 INFO L471 AbstractCegarLoop]: Abstraction has 9911 states and 11906 transitions. [2024-11-18 16:21:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 16:21:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9911 states and 11906 transitions. [2024-11-18 16:21:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-18 16:21:16,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:16,845 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:16,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 16:21:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-18 16:21:17,050 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 591656774, now seen corresponding path program 1 times [2024-11-18 16:21:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14654146] [2024-11-18 16:21:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-18 16:21:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14654146] [2024-11-18 16:21:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14654146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196600530] [2024-11-18 16:21:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:17,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:17,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:17,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 16:21:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:17,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:21:17,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-18 16:21:17,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196600530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-18 16:21:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668165504] [2024-11-18 16:21:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:17,290 INFO L87 Difference]: Start difference. First operand 9911 states and 11906 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 16:21:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:17,817 INFO L93 Difference]: Finished difference Result 17606 states and 21541 transitions. [2024-11-18 16:21:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 203 [2024-11-18 16:21:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:17,850 INFO L225 Difference]: With dead ends: 17606 [2024-11-18 16:21:17,851 INFO L226 Difference]: Without dead ends: 9773 [2024-11-18 16:21:17,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:17,865 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 127 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:17,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 435 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2024-11-18 16:21:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 9751. [2024-11-18 16:21:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9751 states, 8396 states have (on average 1.1787756074321105) internal successors, (9897), 8472 states have internal predecessors, (9897), 704 states have call successors, (704), 557 states have call predecessors, (704), 650 states have return successors, (941), 722 states have call predecessors, (941), 704 states have call successors, (941) [2024-11-18 16:21:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9751 states to 9751 states and 11542 transitions. [2024-11-18 16:21:18,357 INFO L78 Accepts]: Start accepts. Automaton has 9751 states and 11542 transitions. Word has length 203 [2024-11-18 16:21:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:18,358 INFO L471 AbstractCegarLoop]: Abstraction has 9751 states and 11542 transitions. [2024-11-18 16:21:18,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 16:21:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9751 states and 11542 transitions. [2024-11-18 16:21:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-18 16:21:18,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:18,363 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:18,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 16:21:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:18,568 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:18,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash 47058086, now seen corresponding path program 1 times [2024-11-18 16:21:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373037366] [2024-11-18 16:21:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 64 proven. 19 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-18 16:21:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373037366] [2024-11-18 16:21:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373037366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866340318] [2024-11-18 16:21:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:18,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:18,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:18,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 16:21:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:18,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:21:18,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-18 16:21:18,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866340318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-18 16:21:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177319059] [2024-11-18 16:21:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:18,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:18,748 INFO L87 Difference]: Start difference. First operand 9751 states and 11542 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 16:21:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:19,440 INFO L93 Difference]: Finished difference Result 16936 states and 20375 transitions. [2024-11-18 16:21:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 205 [2024-11-18 16:21:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:19,486 INFO L225 Difference]: With dead ends: 16936 [2024-11-18 16:21:19,487 INFO L226 Difference]: Without dead ends: 9429 [2024-11-18 16:21:19,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:19,504 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 147 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:19,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 422 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9429 states. [2024-11-18 16:21:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9429 to 9417. [2024-11-18 16:21:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9417 states, 8098 states have (on average 1.1622622869844406) internal successors, (9412), 8164 states have internal predecessors, (9412), 688 states have call successors, (688), 541 states have call predecessors, (688), 630 states have return successors, (921), 712 states have call predecessors, (921), 688 states have call successors, (921) [2024-11-18 16:21:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9417 states to 9417 states and 11021 transitions. [2024-11-18 16:21:20,316 INFO L78 Accepts]: Start accepts. Automaton has 9417 states and 11021 transitions. Word has length 205 [2024-11-18 16:21:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 9417 states and 11021 transitions. [2024-11-18 16:21:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 16:21:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9417 states and 11021 transitions. [2024-11-18 16:21:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-18 16:21:20,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:20,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:20,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 16:21:20,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:20,528 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:20,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 997545003, now seen corresponding path program 1 times [2024-11-18 16:21:20,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:20,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784043505] [2024-11-18 16:21:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 58 proven. 14 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-18 16:21:20,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784043505] [2024-11-18 16:21:20,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784043505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:20,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131295255] [2024-11-18 16:21:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:20,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:20,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:20,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:20,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 16:21:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:20,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:21:20,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-18 16:21:20,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:20,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131295255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:20,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:20,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-18 16:21:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644141426] [2024-11-18 16:21:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:20,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:20,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:20,791 INFO L87 Difference]: Start difference. First operand 9417 states and 11021 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-18 16:21:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:21,322 INFO L93 Difference]: Finished difference Result 15978 states and 18960 transitions. [2024-11-18 16:21:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:21,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 206 [2024-11-18 16:21:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:21,358 INFO L225 Difference]: With dead ends: 15978 [2024-11-18 16:21:21,358 INFO L226 Difference]: Without dead ends: 9439 [2024-11-18 16:21:21,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:21:21,370 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:21,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9439 states. [2024-11-18 16:21:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9439 to 9415. [2024-11-18 16:21:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9415 states, 8096 states have (on average 1.1448863636363635) internal successors, (9269), 8162 states have internal predecessors, (9269), 688 states have call successors, (688), 541 states have call predecessors, (688), 630 states have return successors, (921), 712 states have call predecessors, (921), 688 states have call successors, (921) [2024-11-18 16:21:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9415 states to 9415 states and 10878 transitions. [2024-11-18 16:21:21,824 INFO L78 Accepts]: Start accepts. Automaton has 9415 states and 10878 transitions. Word has length 206 [2024-11-18 16:21:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 9415 states and 10878 transitions. [2024-11-18 16:21:21,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-18 16:21:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9415 states and 10878 transitions. [2024-11-18 16:21:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-18 16:21:21,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:21,828 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:21,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 16:21:22,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:22,029 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -646628265, now seen corresponding path program 1 times [2024-11-18 16:21:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:22,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431453466] [2024-11-18 16:21:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-18 16:21:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431453466] [2024-11-18 16:21:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431453466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:21:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:21:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536621499] [2024-11-18 16:21:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:22,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:21:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:21:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:21:22,171 INFO L87 Difference]: Start difference. First operand 9415 states and 10878 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-18 16:21:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:23,528 INFO L93 Difference]: Finished difference Result 29883 states and 34973 transitions. [2024-11-18 16:21:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:21:23,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 208 [2024-11-18 16:21:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:23,595 INFO L225 Difference]: With dead ends: 29883 [2024-11-18 16:21:23,595 INFO L226 Difference]: Without dead ends: 24397 [2024-11-18 16:21:23,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:21:23,614 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 425 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:23,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1241 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:21:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24397 states. [2024-11-18 16:21:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24397 to 19911. [2024-11-18 16:21:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19911 states, 17114 states have (on average 1.1547271239920534) internal successors, (19762), 17257 states have internal predecessors, (19762), 1460 states have call successors, (1460), 1137 states have call predecessors, (1460), 1336 states have return successors, (2017), 1517 states have call predecessors, (2017), 1460 states have call successors, (2017) [2024-11-18 16:21:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19911 states to 19911 states and 23239 transitions. [2024-11-18 16:21:24,874 INFO L78 Accepts]: Start accepts. Automaton has 19911 states and 23239 transitions. Word has length 208 [2024-11-18 16:21:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 19911 states and 23239 transitions. [2024-11-18 16:21:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-18 16:21:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 19911 states and 23239 transitions. [2024-11-18 16:21:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-18 16:21:24,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:24,893 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:24,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-18 16:21:24,893 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1159435551, now seen corresponding path program 1 times [2024-11-18 16:21:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871684813] [2024-11-18 16:21:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 67 proven. 97 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-18 16:21:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871684813] [2024-11-18 16:21:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871684813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116437996] [2024-11-18 16:21:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:25,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:25,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:25,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 16:21:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:25,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 16:21:25,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-18 16:21:25,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116437996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-18 16:21:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122680389] [2024-11-18 16:21:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:25,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:21:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:25,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:21:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 16:21:25,198 INFO L87 Difference]: Start difference. First operand 19911 states and 23239 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 16:21:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:25,439 INFO L93 Difference]: Finished difference Result 23287 states and 27076 transitions. [2024-11-18 16:21:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:21:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 334 [2024-11-18 16:21:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:25,465 INFO L225 Difference]: With dead ends: 23287 [2024-11-18 16:21:25,465 INFO L226 Difference]: Without dead ends: 3389 [2024-11-18 16:21:25,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 16:21:25,485 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:25,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 860 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2024-11-18 16:21:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3333. [2024-11-18 16:21:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 2885 states have (on average 1.1202772963604852) internal successors, (3232), 2898 states have internal predecessors, (3232), 221 states have call successors, (221), 173 states have call predecessors, (221), 226 states have return successors, (311), 261 states have call predecessors, (311), 221 states have call successors, (311) [2024-11-18 16:21:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 3764 transitions. [2024-11-18 16:21:25,664 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 3764 transitions. Word has length 334 [2024-11-18 16:21:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 3764 transitions. [2024-11-18 16:21:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 16:21:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 3764 transitions. [2024-11-18 16:21:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-18 16:21:25,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:25,669 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:25,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 16:21:25,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:25,874 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:25,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2140866478, now seen corresponding path program 1 times [2024-11-18 16:21:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907937845] [2024-11-18 16:21:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:25,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-11-18 16:21:26,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907937845] [2024-11-18 16:21:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907937845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142444523] [2024-11-18 16:21:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:26,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:26,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:26,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 16:21:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:26,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 16:21:26,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-18 16:21:26,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142444523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:26,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-18 16:21:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6667285] [2024-11-18 16:21:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:21:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:26,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:21:26,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:21:26,242 INFO L87 Difference]: Start difference. First operand 3333 states and 3764 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 16:21:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:26,436 INFO L93 Difference]: Finished difference Result 6013 states and 6861 transitions. [2024-11-18 16:21:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:21:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 340 [2024-11-18 16:21:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:26,462 INFO L225 Difference]: With dead ends: 6013 [2024-11-18 16:21:26,462 INFO L226 Difference]: Without dead ends: 3189 [2024-11-18 16:21:26,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:21:26,467 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:26,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2024-11-18 16:21:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2024-11-18 16:21:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 2750 states have (on average 1.1229090909090909) internal successors, (3088), 2754 states have internal predecessors, (3088), 221 states have call successors, (221), 173 states have call predecessors, (221), 217 states have return successors, (302), 261 states have call predecessors, (302), 221 states have call successors, (302) [2024-11-18 16:21:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 3611 transitions. [2024-11-18 16:21:26,662 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 3611 transitions. Word has length 340 [2024-11-18 16:21:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:26,662 INFO L471 AbstractCegarLoop]: Abstraction has 3189 states and 3611 transitions. [2024-11-18 16:21:26,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 16:21:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 3611 transitions. [2024-11-18 16:21:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-18 16:21:26,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:26,667 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:26,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 16:21:26,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-18 16:21:26,872 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:26,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1133813714, now seen corresponding path program 2 times [2024-11-18 16:21:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799610525] [2024-11-18 16:21:26,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 16:21:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:26,900 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 16:21:26,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 16:21:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2024-11-18 16:21:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799610525] [2024-11-18 16:21:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799610525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960964972] [2024-11-18 16:21:27,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 16:21:27,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:27,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:27,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:27,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 16:21:27,157 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 16:21:27,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 16:21:27,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:21:27,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-18 16:21:27,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960964972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-18 16:21:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183048117] [2024-11-18 16:21:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:21:27,185 INFO L87 Difference]: Start difference. First operand 3189 states and 3611 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-18 16:21:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:27,372 INFO L93 Difference]: Finished difference Result 4802 states and 5450 transitions. [2024-11-18 16:21:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 341 [2024-11-18 16:21:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:27,388 INFO L225 Difference]: With dead ends: 4802 [2024-11-18 16:21:27,388 INFO L226 Difference]: Without dead ends: 2122 [2024-11-18 16:21:27,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:21:27,390 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 22 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:27,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2024-11-18 16:21:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1995. [2024-11-18 16:21:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1727 states have (on average 1.1088592935726693) internal successors, (1915), 1733 states have internal predecessors, (1915), 133 states have call successors, (133), 109 states have call predecessors, (133), 134 states have return successors, (172), 152 states have call predecessors, (172), 133 states have call successors, (172) [2024-11-18 16:21:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2220 transitions. [2024-11-18 16:21:27,504 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2220 transitions. Word has length 341 [2024-11-18 16:21:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:27,505 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 2220 transitions. [2024-11-18 16:21:27,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-18 16:21:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2220 transitions. [2024-11-18 16:21:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-18 16:21:27,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:27,509 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:27,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 16:21:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-18 16:21:27,713 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1506952644, now seen corresponding path program 1 times [2024-11-18 16:21:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664253960] [2024-11-18 16:21:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 49 proven. 48 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-18 16:21:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664253960] [2024-11-18 16:21:27,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664253960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129179435] [2024-11-18 16:21:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:27,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:27,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:27,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 16:21:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:28,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:21:28,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2024-11-18 16:21:28,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:28,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129179435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:28,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-11-18 16:21:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890543426] [2024-11-18 16:21:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:28,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:21:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:28,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:21:28,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:21:28,181 INFO L87 Difference]: Start difference. First operand 1995 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-18 16:21:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:28,335 INFO L93 Difference]: Finished difference Result 3324 states and 3776 transitions. [2024-11-18 16:21:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:21:28,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 372 [2024-11-18 16:21:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:28,357 INFO L225 Difference]: With dead ends: 3324 [2024-11-18 16:21:28,357 INFO L226 Difference]: Without dead ends: 2264 [2024-11-18 16:21:28,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:21:28,360 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 129 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:28,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-11-18 16:21:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2024-11-18 16:21:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 1956 states have (on average 1.1037832310838447) internal successors, (2159), 1962 states have internal predecessors, (2159), 153 states have call successors, (153), 129 states have call predecessors, (153), 154 states have return successors, (213), 172 states have call predecessors, (213), 153 states have call successors, (213) [2024-11-18 16:21:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2525 transitions. [2024-11-18 16:21:28,552 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2525 transitions. Word has length 372 [2024-11-18 16:21:28,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:28,552 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 2525 transitions. [2024-11-18 16:21:28,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-18 16:21:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2525 transitions. [2024-11-18 16:21:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-18 16:21:28,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:28,557 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:28,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 16:21:28,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-18 16:21:28,762 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:28,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:28,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1416892354, now seen corresponding path program 1 times [2024-11-18 16:21:28,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:28,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630516920] [2024-11-18 16:21:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 56 proven. 88 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2024-11-18 16:21:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630516920] [2024-11-18 16:21:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630516920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664208711] [2024-11-18 16:21:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:28,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:28,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:28,873 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:28,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 16:21:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:29,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 16:21:29,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-18 16:21:29,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:21:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664208711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:21:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:21:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-18 16:21:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458182902] [2024-11-18 16:21:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:21:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:21:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:21:29,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:21:29,045 INFO L87 Difference]: Start difference. First operand 2264 states and 2525 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-18 16:21:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:29,166 INFO L93 Difference]: Finished difference Result 4121 states and 4618 transitions. [2024-11-18 16:21:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:21:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 372 [2024-11-18 16:21:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:29,184 INFO L225 Difference]: With dead ends: 4121 [2024-11-18 16:21:29,184 INFO L226 Difference]: Without dead ends: 2264 [2024-11-18 16:21:29,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:21:29,186 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:29,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 690 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:21:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-11-18 16:21:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2264. [2024-11-18 16:21:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 1956 states have (on average 1.098159509202454) internal successors, (2148), 1962 states have internal predecessors, (2148), 153 states have call successors, (153), 129 states have call predecessors, (153), 154 states have return successors, (213), 172 states have call predecessors, (213), 153 states have call successors, (213) [2024-11-18 16:21:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2514 transitions. [2024-11-18 16:21:29,326 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2514 transitions. Word has length 372 [2024-11-18 16:21:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:29,326 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 2514 transitions. [2024-11-18 16:21:29,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-18 16:21:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2514 transitions. [2024-11-18 16:21:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-18 16:21:29,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:21:29,329 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:29,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-18 16:21:29,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-18 16:21:29,531 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:21:29,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:21:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1920158466, now seen corresponding path program 1 times [2024-11-18 16:21:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:21:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214404638] [2024-11-18 16:21:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:21:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 62 proven. 15 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2024-11-18 16:21:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:21:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214404638] [2024-11-18 16:21:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214404638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:21:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258493698] [2024-11-18 16:21:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:21:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:21:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:21:29,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:21:29,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-18 16:21:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:21:29,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 16:21:29,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:21:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 359 proven. 4 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-18 16:21:30,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 16:21:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 56 proven. 16 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-18 16:21:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258493698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 16:21:30,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 16:21:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2024-11-18 16:21:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995773621] [2024-11-18 16:21:30,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 16:21:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 16:21:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:21:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 16:21:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-18 16:21:30,303 INFO L87 Difference]: Start difference. First operand 2264 states and 2514 transitions. Second operand has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 10 states have internal predecessors, (367), 4 states have call successors, (56), 5 states have call predecessors, (56), 7 states have return successors, (58), 5 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-18 16:21:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:21:30,632 INFO L93 Difference]: Finished difference Result 2773 states and 3058 transitions. [2024-11-18 16:21:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 16:21:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 10 states have internal predecessors, (367), 4 states have call successors, (56), 5 states have call predecessors, (56), 7 states have return successors, (58), 5 states have call predecessors, (58), 4 states have call successors, (58) Word has length 372 [2024-11-18 16:21:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:21:30,643 INFO L225 Difference]: With dead ends: 2773 [2024-11-18 16:21:30,643 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 16:21:30,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 740 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-18 16:21:30,646 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 191 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:21:30,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 657 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:21:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 16:21:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 16:21:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 16:21:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 16:21:30,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 372 [2024-11-18 16:21:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:21:30,654 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 16:21:30,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 10 states have internal predecessors, (367), 4 states have call successors, (56), 5 states have call predecessors, (56), 7 states have return successors, (58), 5 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-18 16:21:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 16:21:30,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 16:21:30,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 16:21:30,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 16:21:30,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-18 16:21:30,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-18 16:21:30,863 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:21:30,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 16:22:09,829 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 16:22:09,934 WARN L156 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (let ((.cse1 (= 0 ~t2_pc~0)) (.cse0 (= ~m_pc~0 1))) (and (or (not .cse0) (not .cse1) (= 0 ~t2_st~0)) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t2_st~0)| ~t2_st~0) (not (= ~m_st~0 0)) (let ((.cse20 (= ~E_M~0 1))) (let ((.cse16 (= ~m_pc~0 0)) (.cse7 (<= 2 |old(~t1_st~0)|)) (.cse9 (<= 2 ~E_2~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~p_dw_pc~0 0)) (.cse4 (= ~T1_E~0 ~M_E~0)) (.cse17 (<= 2 ~E_1~0)) (.cse5 (= ~t1_i~0 1)) (.cse18 (= (+ ~local~0 1) ~token~0)) (.cse6 (not (= |old(~t2_st~0)| 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~t2_pc~0 1)) (.cse19 (<= 1 ~E_2~0)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~M_E~0 2)) (.cse15 (not .cse20))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15) (and .cse3 .cse5 .cse8 (= |old(~t1_st~0)| 0) .cse11 .cse12 .cse13 .cse16) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse18 .cse8 .cse0 .cse19 .cse11 .cse12 .cse13 .cse1 .cse14 .cse15) (and .cse3 (<= 1 ~t1_pc~0) .cse5 .cse8 .cse11 .cse12 .cse13 .cse16) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 (= ~token~0 (+ 2 ~local~0)) .cse12 .cse13 .cse14 .cse20) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse18 .cse6 .cse8 .cse10 .cse0 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15)))))) Eliminated clause: (let ((.cse1 (= 0 ~t2_pc~0)) (.cse0 (= ~m_pc~0 1)) (.cse2 (= 0 ~t2_st~0))) (and (or (not .cse0) (not .cse1) .cse2) (not (= ~m_st~0 0)) (let ((.cse20 (= ~E_M~0 1))) (let ((.cse8 (= ~m_pc~0 0)) (.cse18 (= (+ ~local~0 1) ~token~0)) (.cse19 (<= 1 ~E_2~0)) (.cse5 (not (= ~E_M~0 0))) (.cse16 (not .cse20)) (.cse9 (= ~t1_pc~0 1)) (.cse10 (<= 2 ~t1_st~0)) (.cse3 (= ~p_dw_pc~0 0)) (.cse17 (<= 2 ~E_1~0)) (.cse4 (= ~t1_i~0 1)) (.cse11 (= ~T1_E~0 2)) (.cse12 (<= 2 ~E_2~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (not .cse2)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse15 (= ~M_E~0 2))) (or (and .cse3 (<= 1 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 .cse4 (= ~t1_st~0 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse0 .cse5 .cse14 .cse6 .cse7 (= ~token~0 ~local~0) .cse15 .cse16) (and .cse9 .cse3 .cse17 .cse4 .cse18 .cse11 .cse13 .cse0 .cse19 .cse5 .cse14 .cse6 .cse7 .cse15 .cse16) (and .cse9 .cse3 .cse17 .cse4 .cse18 .cse11 .cse0 .cse19 .cse5 .cse6 .cse7 .cse1 .cse15 .cse16) (and .cse9 .cse10 .cse3 .cse17 .cse4 .cse11 .cse12 .cse13 .cse0 (= ~token~0 (+ 2 ~local~0)) .cse14 .cse6 .cse7 .cse15 .cse20)))))) [2024-11-18 16:22:09,992 WARN L156 FloydHoareUtils]: Requires clause for update_channels1 contained old-variable. Original clause: (and (not (= ~c_dr_pc~0 2)) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (not (= ~c_dr_pc~0 2)) [2024-11-18 16:22:10,040 WARN L156 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (let ((.cse1 (= ~m_st~0 0)) (.cse29 (= |old(~m_st~0)| 0))) (let ((.cse0 (not .cse29)) (.cse27 (= |old(~t2_st~0)| ~t2_st~0)) (.cse2 (= ~t1_st~0 0)) (.cse28 (not .cse1))) (and (or .cse0 (and .cse1 .cse2 (= 0 ~t2_st~0))) (let ((.cse25 (= ~E_M~0 1)) (.cse4 (= |old(~t2_st~0)| 0))) (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse12 (<= 1 ~E_2~0)) (.cse6 (= ~T1_E~0 ~M_E~0)) (.cse16 (= ~M_E~0 2)) (.cse9 (= (+ ~local~0 1) ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse7 (<= 2 ~E_1~0)) (.cse21 (not .cse4)) (.cse26 (not (= ~T1_E~0 1))) (.cse22 (<= 2 |old(~t1_st~0)|)) (.cse23 (<= 2 ~E_2~0)) (.cse24 (= ~t2_pc~0 1)) (.cse11 (= ~m_pc~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse17 (not .cse25)) (.cse5 (= ~p_dw_pc~0 0)) (.cse8 (= ~t1_i~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~t2_i~0 1)) (.cse19 (= ~m_pc~0 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse5 .cse8 .cse10 .cse18 .cse13 .cse0 .cse14 .cse19) (and .cse4 .cse5 .cse6 (= ~E_1~0 ~M_E~0) .cse8 .cse10 .cse18 .cse13 .cse14 .cse19 (= ~E_2~0 ~M_E~0) .cse15 .cse20 .cse16 .cse17) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse21 .cse22 .cse10 .cse23 .cse24 .cse11 (= ~token~0 (+ 2 ~local~0)) .cse14 .cse16 .cse25) (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse3 .cse5 .cse6 .cse8 .cse21 .cse22 .cse10 .cse23 .cse24 .cse11 .cse13 .cse14 .cse20 .cse16 .cse17) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse21 .cse26 .cse22 .cse10 .cse23 .cse24 .cse11 .cse13 .cse14 .cse17) (and .cse3 .cse5 .cse7 .cse8 .cse21 .cse26 .cse22 .cse10 .cse23 .cse24 .cse11 .cse13 .cse14 .cse20 .cse17) (and .cse5 (<= 1 ~t1_pc~0) .cse8 .cse10 .cse13 .cse14 .cse19)))) (or (and (= |old(~t1_st~0)| ~t1_st~0) .cse27 .cse28) (< ~t1_pc~0 1)) (or (< 0 ~t1_pc~0) .cse29 (and .cse27 .cse2 .cse28))))) Eliminated clause: (exists ((|old(~t2_st~0)| Int) (|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse5 (= |old(~m_st~0)| 0)) (.cse1 (= ~m_st~0 0))) (let ((.cse3 (= |old(~t2_st~0)| ~t2_st~0)) (.cse2 (= ~t1_st~0 0)) (.cse4 (not .cse1)) (.cse0 (not .cse5))) (and (or .cse0 (and .cse1 .cse2 (= 0 ~t2_st~0))) (or (and (= |old(~t1_st~0)| ~t1_st~0) .cse3 .cse4) (< ~t1_pc~0 1)) (or (< 0 ~t1_pc~0) .cse5 (and .cse3 .cse2 .cse4)) (let ((.cse19 (= ~E_M~0 1)) (.cse25 (= |old(~t2_st~0)| 0))) (let ((.cse27 (= 0 ~t2_pc~0)) (.cse22 (= (+ ~local~0 1) ~token~0)) (.cse29 (<= 1 ~E_2~0)) (.cse8 (<= 2 ~E_1~0)) (.cse23 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_pc~0 1)) (.cse10 (= ~T1_E~0 2)) (.cse11 (not .cse25)) (.cse12 (<= 2 |old(~t1_st~0)|)) (.cse13 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse15 (= ~m_pc~0 1)) (.cse28 (= ~token~0 ~local~0)) (.cse18 (= ~M_E~0 2)) (.cse24 (not .cse19)) (.cse7 (= ~p_dw_pc~0 0)) (.cse9 (= ~t1_i~0 1)) (.cse26 (= |old(~t1_st~0)| 0)) (.cse20 (not (= ~E_M~0 0))) (.cse16 (= ~t2_i~0 1)) (.cse17 (= ~c_dr_pc~0 0)) (.cse21 (= ~m_pc~0 0))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 (+ 2 ~local~0)) .cse16 .cse17 .cse18 .cse19) (and .cse7 (<= 1 ~t1_pc~0) .cse9 .cse20 .cse16 .cse17 .cse21) (and .cse6 .cse7 .cse8 .cse9 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse24) (and .cse25 .cse7 .cse9 .cse10 .cse26 .cse20 (= ~E_2~0 2) .cse16 .cse17 .cse21 .cse27 .cse28 (= ~E_1~0 2) .cse18 .cse24) (and .cse6 .cse25 .cse7 .cse8 .cse9 .cse22 .cse10 .cse15 .cse29 .cse20 .cse16 .cse17 .cse27 .cse18 .cse24) (and .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse14 .cse15 .cse29 .cse20 .cse16 .cse17 .cse18 .cse24) (and .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse28 .cse24) (and .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse28 .cse18 .cse24) (and .cse7 .cse9 .cse26 .cse20 .cse0 .cse16 .cse17 .cse21)))))))) [2024-11-18 16:22:10,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 16:22:10,154 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (let ((.cse19 (= 0 ~t2_st~0))) (let ((.cse15 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse5 (<= 2 |old(~E_2~0)|)) (.cse8 (= |old(~T1_E~0)| |old(~M_E~0)|)) (.cse9 (= ~t2_pc~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 |old(~E_1~0)|)) (.cse12 (not .cse19)) (.cse16 (= 2 |old(~M_E~0)|)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (not (= |old(~E_M~0)| 1))) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (not (= |old(~E_M~0)| 0))) (.cse17 (= ~t1_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (= ~t2_i~0 1)) (.cse18 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 (= |old(~E_2~0)| |old(~M_E~0)|) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse17 .cse14 .cse18 (= 0 ~t2_pc~0) .cse19 .cse15 (= |old(~E_1~0)| |old(~M_E~0)|) .cse16) (and .cse2 (<= 1 ~t1_pc~0) .cse3 .cse4 .cse6 .cse7 .cse13 .cse14 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse13 .cse14 .cse18)))) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|)) Eliminated clause: (let ((.cse8 (= 0 ~t2_st~0))) (let ((.cse9 (= ~token~0 ~local~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~E_1~0)) (.cse2 (= ~T1_E~0 2)) (.cse16 (<= 2 ~E_2~0)) (.cse17 (= ~t2_pc~0 1)) (.cse18 (= ~m_pc~0 1)) (.cse19 (not .cse8)) (.cse10 (= ~M_E~0 2)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~t1_st~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse12 (not (= ~m_st~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 (= ~E_2~0 2) .cse5 .cse6 .cse7 (= 0 ~t2_pc~0) .cse8 .cse9 (= ~E_1~0 2) .cse10 .cse11) (and .cse0 (<= 1 ~t1_pc~0) .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse11) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse2 .cse16 .cse17 .cse18 .cse4 .cse19 .cse12 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse0 .cse15 .cse1 (= (+ ~local~0 1) ~token~0) .cse2 .cse16 .cse17 .cse18 .cse4 .cse19 .cse12 .cse5 .cse6 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse11)))) [2024-11-18 16:22:10,176 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events1 contained old-variable. Original clause: (and (not (= ~c_dr_pc~0 2)) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (not (= ~c_dr_pc~0 2)) [2024-11-18 16:22:10,353 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events1 contained old-variable. Original clause: (and (not (= ~c_dr_pc~0 2)) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (not (= ~c_dr_pc~0 2)) [2024-11-18 16:22:10,415 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (let ((.cse19 (= 0 ~t2_st~0))) (let ((.cse15 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse5 (<= 2 |old(~E_2~0)|)) (.cse8 (= |old(~T1_E~0)| |old(~M_E~0)|)) (.cse9 (= ~t2_pc~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 |old(~E_1~0)|)) (.cse12 (not .cse19)) (.cse16 (= 2 |old(~M_E~0)|)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (not (= |old(~E_M~0)| 1))) (.cse4 (= ~t1_i~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (not (= |old(~E_M~0)| 0))) (.cse17 (= ~t1_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (= ~t2_i~0 1)) (.cse18 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 (= |old(~E_2~0)| |old(~M_E~0)|) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse17 .cse14 .cse18 (= 0 ~t2_pc~0) .cse19 .cse15 (= |old(~E_1~0)| |old(~M_E~0)|) .cse16) (and .cse2 (<= 1 ~t1_pc~0) .cse3 .cse4 .cse6 .cse7 .cse13 .cse14 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse13 .cse14 .cse18)))) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|)) Eliminated clause: (let ((.cse8 (= 0 ~t2_st~0))) (let ((.cse9 (= ~token~0 ~local~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~E_1~0)) (.cse2 (= ~T1_E~0 2)) (.cse16 (<= 2 ~E_2~0)) (.cse17 (= ~t2_pc~0 1)) (.cse18 (= ~m_pc~0 1)) (.cse19 (not .cse8)) (.cse10 (= ~M_E~0 2)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~t1_st~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse12 (not (= ~m_st~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 (= ~E_2~0 2) .cse5 .cse6 .cse7 (= 0 ~t2_pc~0) .cse8 .cse9 (= ~E_1~0 2) .cse10 .cse11) (and .cse0 (<= 1 ~t1_pc~0) .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse11) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse2 .cse16 .cse17 .cse18 .cse4 .cse19 .cse12 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse0 .cse15 .cse1 (= (+ ~local~0 1) ~token~0) .cse2 .cse16 .cse17 .cse18 .cse4 .cse19 .cse12 .cse5 .cse6 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse11)))) [2024-11-18 16:22:10,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:22:10 BoogieIcfgContainer [2024-11-18 16:22:10,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 16:22:10,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 16:22:10,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 16:22:10,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 16:22:10,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:20:48" (3/4) ... [2024-11-18 16:22:10,473 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 16:22:10,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-18 16:22:10,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2024-11-18 16:22:10,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-18 16:22:10,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2024-11-18 16:22:10,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2024-11-18 16:22:10,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-18 16:22:10,496 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-18 16:22:10,497 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 16:22:10,497 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 16:22:10,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 16:22:10,759 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 16:22:10,760 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 16:22:10,760 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 16:22:10,760 INFO L158 Benchmark]: Toolchain (without parser) took 83446.58ms. Allocated memory was 159.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 102.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2024-11-18 16:22:10,762 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 119.2MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 16:22:10,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.74ms. Allocated memory is still 159.4MB. Free memory was 101.9MB in the beginning and 81.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 16:22:10,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.98ms. Allocated memory is still 159.4MB. Free memory was 81.3MB in the beginning and 78.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 16:22:10,763 INFO L158 Benchmark]: Boogie Preprocessor took 103.66ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 74.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 16:22:10,763 INFO L158 Benchmark]: RCFGBuilder took 938.89ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 96.1MB in the end (delta: -21.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-18 16:22:10,763 INFO L158 Benchmark]: TraceAbstraction took 81647.41ms. Allocated memory was 159.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 96.1MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2024-11-18 16:22:10,763 INFO L158 Benchmark]: Witness Printer took 289.58ms. Allocated memory is still 5.0GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 16:22:10,763 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 119.2MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.74ms. Allocated memory is still 159.4MB. Free memory was 101.9MB in the beginning and 81.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.98ms. Allocated memory is still 159.4MB. Free memory was 81.3MB in the beginning and 78.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.66ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 74.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 938.89ms. Allocated memory is still 159.4MB. Free memory was 74.6MB in the beginning and 96.1MB in the end (delta: -21.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 81647.41ms. Allocated memory was 159.4MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 96.1MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 289.58ms. Allocated memory is still 5.0GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 252 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 41.9s, OverallIterations: 39, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10126 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9950 mSDsluCounter, 25114 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16375 mSDsCounter, 1104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7079 IncrementalHoareTripleChecker+Invalid, 8183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1104 mSolverCounterUnsat, 8739 mSDtfsCounter, 7079 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4018 GetRequests, 3811 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19911occurred in iteration=33, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 6936 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 8999 NumberOfCodeBlocks, 8999 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 9319 ConstructedInterpolants, 0 QuantifiedInterpolants, 13724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9766 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 52 InterpolantComputations, 38 PerfectInterpolantSequences, 9926/10302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 218]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 684]: Location Invariant Derived location invariant: (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1)) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (M_E == 2)) && (E_M != 1))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) - InvariantResult [Line: 640]: Location Invariant Derived location invariant: (((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1)) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (token == ((long long) 2 + local))) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (c_dr_pc != 2) - InvariantResult [Line: 720]: Location Invariant Derived location invariant: (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) - InvariantResult [Line: 172]: Location Invariant Derived location invariant: (c_dr_pc != 2) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (token == ((long long) 2 + local))) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (c_dr_pc != 2) - ProcedureContractResult [Line: 1029]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Requires: (((((m_pc != 1) || (0 != t2_pc)) || (0 == t2_st)) && (m_st != 0)) && ((((((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) || (((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (t2_pc == 1)) && (m_pc == 1)) && (1 <= E_2)) && (E_M != 0)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (m_pc == 1)) && (1 <= E_2)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (token == ((long long) 2 + local))) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M == 1)))) Ensures: ((((((((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (m_pc == 1)) && (1 <= E_2)) && (E_M != 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (M_E == 2)) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (\old(t2_st) != 0)) && (2 <= \old(t1_st))) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (token == ((long long) 2 + local))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M == 1))) || ((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= \old(t1_st))) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (\old(t2_st) != 0)) && (t2_pc == 1)) && (m_pc == 1)) && (1 <= E_2)) && (E_M != 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && (\old(t1_st) == 0)) && (E_M != 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0))) && ((((m_pc != 1) || (((\old(t1_st) == t1_st) && (m_st != 0)) && (0 == t2_st))) || (((t1_st == 0) && (m_st != 0)) && (0 == t2_st))) || (0 != t2_pc))) && (((((((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) && (m_st != 0)) || (((\old(t1_st) == t1_st) && (m_st != 0)) && (0 == t2_st))) || (((t1_st == 0) && (m_st != 0)) && (0 == t2_st))) || (((\old(t2_st) == t2_st) && (t1_st == 0)) && (m_st != 0))) || (E_M == 1))) && ((((((((((\old(t2_st) == 0) || (E_2 != 2)) || (M_E != 2)) || (\old(t1_st) < 2)) || (t1_pc != 1)) || (T1_E != 2)) || (0 != t2_st)) || (t2_pc != 1)) || (E_M == 1)) || (token != local))) && (((m_pc != 1) || (0 != t2_st)) || (token != local))) && (((((((((\old(t2_st) == 0) || (E_2 != 2)) || (0 < t1_pc)) || (M_E != 2)) || (T1_E != 2)) || (0 != t2_st)) || (t2_pc != 1)) || (E_M == 1)) || (token != local))) && ((((m_st == 0) && (((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) || ((\old(t1_st) == t1_st) && (0 == t2_st)))) || (m_pc != 1)) || (E_M != 1))) && (((m_pc != 0) || ((((\old(t2_st) == t2_st) && (t1_st == 0)) || ((t1_st == 0) && (0 == t2_st))) && (m_st != 0))) || ((m_st != 0) && (((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) || ((\old(t1_st) == t1_st) && (0 == t2_st)))))) && ((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 262]: Procedure Contract for update_channels1 Derived contract for procedure update_channels1. Requires: (c_dr_pc != 2) Ensures: ((c_dr_pc != 2) && (((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 995]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Ensures: (((((((((((((((((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) && (m_st != 0)) || (m_pc != 1)) || (((\old(t2_st) == t2_st) && (t1_st == 0)) && (m_st != 0))) || (token != local)) && ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (\old(t2_st) != 0)) && (2 <= \old(t1_st))) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M == 1)) || (((((((p_dw_pc == 0) && (t1_i == 1)) && (E_M != 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (\old(t2_st) != 0)) && (T1_E != 1)) && (2 <= \old(t1_st))) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((((((\old(t2_st) == 0) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (\old(t1_st) == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (\old(t2_st) != 0)) && (T1_E != 1)) && (2 <= \old(t1_st))) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (\old(t2_st) != 0)) && (t2_pc == 1)) && (m_pc == 1)) && (1 <= E_2)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2))) || ((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (\old(t2_st) != 0)) && (2 <= \old(t1_st))) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2))) || ((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (m_pc == 1)) && (1 <= E_2)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (M_E == 2)))) && (((0 < t1_pc) || (\old(m_st) == 0)) || (((((\old(t1_st) == 0) && (t1_st == 0)) && (0 == t2_st)) || (((\old(t1_st) == 0) && (\old(t2_st) == t2_st)) && (t1_st == 0))) && (m_st != 0)))) && ((((((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) && (m_st != 0)) || (m_pc != 1)) || (((\old(t1_st) == t1_st) && (m_st != 0)) && (0 == t2_st))) || (((long long) local + 1) != token))) && ((((((((((\old(t2_st) == 0) || (E_2 != 2)) || (M_E != 2)) || (\old(t1_st) < 2)) || (t1_pc != 1)) || (T1_E != 2)) || (0 != t2_st)) || (t2_pc != 1)) || (E_M == 1)) || (token != local))) && ((\old(m_st) != 0) || (((m_st == 0) && (t1_st == 0)) && (0 == t2_st)))) && (((((((((\old(t2_st) == 0) || (E_2 != 2)) || (0 < t1_pc)) || (M_E != 2)) || (T1_E != 2)) || (0 != t2_st)) || (t2_pc != 1)) || (E_M == 1)) || (token != local))) && ((((((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) && (m_st != 0)) || (m_pc != 1)) || (E_1 < 2)) || (token != local))) && (((((((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) && (m_st != 0)) || (E_2 == 1)) || (\old(t1_st) < 2)) || (m_pc != 1)) || (((long long) local + 1) != token))) && ((((m_pc != 0) || ((((\old(t2_st) == t2_st) && (t1_st == 0)) || ((t1_st == 0) && (0 == t2_st))) && (m_st != 0))) || (t1_pc < 1)) || ((m_st != 0) && (((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) || ((\old(t1_st) == t1_st) && (0 == t2_st)))))) && ((((m_st == 0) && (((\old(t1_st) == t1_st) && (\old(t2_st) == t2_st)) || ((\old(t1_st) == t1_st) && (0 == t2_st)))) || (m_pc != 1)) || (E_M != 1))) && ((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 387]: Procedure Contract for activate_threads1 Derived contract for procedure activate_threads1. Requires: (c_dr_pc != 2) Ensures: ((c_dr_pc != 2) && (((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 798]: Procedure Contract for update_channels2 Derived contract for procedure update_channels2. Requires: ((((((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) Ensures: (((((((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 919]: Procedure Contract for fire_delta_events2 Derived contract for procedure fire_delta_events2. Requires: ((((((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) Ensures: ((((((((((2 <= E_1) && (\old(E_2) <= E_2)) || (m_pc != 1)) && (E_M == \old(E_M))) && (E_M != 0)) && (((((((T1_E == 2) || (\old(T1_E) != 2)) && (2 != \old(E_1))) || (((T1_E == 2) || (\old(T1_E) != 2)) && (E_1 == \old(E_1)))) && (E_2 == \old(E_2))) || ((2 != \old(E_2)) && ((((T1_E == 2) || (\old(T1_E) != 2)) && (2 != \old(E_1))) || (((T1_E == 2) || (\old(T1_E) != 2)) && (E_1 == \old(E_1)))))) || (2 != \old(M_E)))) && ((((((((((((((((2 == \old(E_1)) && (t1_i == 1)) && (2 == \old(E_2))) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2)) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (t1_i == 1)) && (2 <= \old(E_2))) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= \old(E_1))) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2))) || (((((t1_i == 1) && (t1_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (m_pc == 0))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= \old(E_2))) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= \old(E_1))) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (2 == \old(M_E))) && (\old(T1_E) == 2))) || (((((1 <= t1_pc) && (t1_i == 1)) && (m_st != 0)) && (t2_i == 1)) && (m_pc == 0)))) && ((((p_dw_pc == 0) && (c_dr_pc == 0)) && (\old(M_E) == 0)) || (((p_dw_pc == 0) && (M_E == \old(M_E))) && (c_dr_pc == 0)))) && (E_M != 1)) && (((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 315]: Procedure Contract for fire_delta_events1 Derived contract for procedure fire_delta_events1. Requires: (c_dr_pc != 2) Ensures: (((c_dr_pc != 2) && ((\old(q_read_ev) == q_read_ev) || (\old(q_read_ev) == 0))) && (((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 99]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: (c_dr_pc != 2) Ensures: ((c_dr_pc != 2) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 70]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: (c_dr_pc != 2) Ensures: ((((((((p_dw_pc != 0) || (c_dr_pc != 1)) || (\result == 0)) && (((p_dw_pc == 1) || (\result == 0)) || (q_read_ev != 2))) && (c_dr_pc != 2)) && (((q_read_ev != 0) || (p_dw_pc == 1)) || (\result == 0))) && (((c_dr_pc != 0) || (p_dw_pc != 0)) || (\result == 0))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 295]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. Requires: (c_dr_pc != 2) Ensures: ((c_dr_pc != 2) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 23]: Procedure Contract for error1 Derived contract for procedure error1. Requires: 0 Ensures: (0 && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 829]: Procedure Contract for exists_runnable_thread2 Derived contract for procedure exists_runnable_thread2. Requires: (((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E != 1)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E != 1)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (token == ((long long) 2 + local))) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) Ensures: (((((((((m_pc != 1) || (0 < \result)) || (0 != t2_st)) && ((((m_pc != 1) || (\result == 0)) || (0 == t2_st)) || (((long long) local + 1) != token))) && ((0 < \result) || (m_st != 0))) && (((m_pc != 1) || (0 < \result)) || (t1_st != 0))) && (((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && (T1_E == 2)) && (t2_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E != 1)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (m_pc == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || ((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E != 1)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_st == 0)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (token == ((long long) 2 + local))) && (0 != t2_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (m_pc == 1)) && (E_M != 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (M_E == 2)) && (E_M != 1)))) && (((((t1_st < 2) || (m_pc != 1)) || (\result == 0)) || (t2_pc != 1)) || (token != local))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 333]: Procedure Contract for reset_delta_events1 Derived contract for procedure reset_delta_events1. Requires: (c_dr_pc != 2) Ensures: ((((\old(q_read_ev) == q_read_ev) || ((\old(q_read_ev) != 0) && (q_read_ev == 2))) && (c_dr_pc != 2)) && (((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 957]: Procedure Contract for reset_delta_events2 Derived contract for procedure reset_delta_events2. Requires: ((((((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (T1_E == 2)) && (t1_pc <= 0)) && (t1_st == 0)) && (E_M != 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (t1_i == 1)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) && (M_E == 2)) && (E_M != 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (T1_E == 2)) && (2 <= E_2)) && (t2_pc == 1)) && (m_pc == 1)) && (E_M != 0)) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (M_E == 2)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (t1_i == 1)) && (t1_st == 0)) && (E_M != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M != 1))) Ensures: (((((((2 <= E_1) && (\old(E_2) <= E_2)) || (m_pc != 1)) && (((((((((((((p_dw_pc == 0) && (1 <= t1_pc)) && (\old(E_M) != 1)) && (t1_i == 1)) && (\old(E_M) != 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) || ((((((((((((2 == \old(E_1)) && (t1_i == 1)) && (2 == \old(E_2))) && (t1_pc <= 0)) && (t1_st == 0)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (t1_i == 1)) && (2 <= \old(E_2))) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= \old(E_1))) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2))) || (((((((((p_dw_pc == 0) && (\old(E_M) != 1)) && (t1_i == 1)) && (\old(E_M) != 0)) && (t1_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0))) || (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 <= \old(E_2))) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= \old(E_1))) && (0 != t2_st)) && (m_st != 0)) && (t2_i == 1)) && (2 == \old(M_E))) && (\old(T1_E) == 2)))) && (((((((2 != \old(E_1)) && (((((p_dw_pc == 0) && (\old(T1_E) == T1_E)) && (E_M != 0)) && (c_dr_pc == 0)) || (((\old(T1_E) != 2) && (E_M != 0)) && (c_dr_pc == 0)))) && (E_M != 1)) || ((((E_M == \old(E_M)) && (((((p_dw_pc == 0) && (\old(T1_E) == T1_E)) && (E_M != 0)) && (c_dr_pc == 0)) || (((\old(T1_E) != 2) && (E_M != 0)) && (c_dr_pc == 0)))) && (E_1 == \old(E_1))) && (E_M != 1))) && (E_2 == \old(E_2))) || (2 != \old(M_E))) || ((2 != \old(E_2)) && ((((2 != \old(E_1)) && (((((p_dw_pc == 0) && (\old(T1_E) == T1_E)) && (E_M != 0)) && (c_dr_pc == 0)) || (((\old(T1_E) != 2) && (E_M != 0)) && (c_dr_pc == 0)))) && (E_M != 1)) || ((((E_M == \old(E_M)) && (((((p_dw_pc == 0) && (\old(T1_E) == T1_E)) && (E_M != 0)) && (c_dr_pc == 0)) || (((\old(T1_E) != 2) && (E_M != 0)) && (c_dr_pc == 0)))) && (E_1 == \old(E_1))) && (E_M != 1)))))) && (((M_E == \old(M_E)) && (((\old(E_2) != \old(M_E)) && (((((\old(M_E) != 1) && (E_M == \old(E_M))) && (((((p_dw_pc == 0) && (E_M != 0)) && (\old(T1_E) != \old(M_E))) && (c_dr_pc == 0)) || (\old(T1_E) == T1_E))) && (E_1 == \old(E_1))) || (((\old(E_1) != \old(M_E)) && (E_M == \old(E_M))) && (((((p_dw_pc == 0) && (E_M != 0)) && (\old(T1_E) != \old(M_E))) && (c_dr_pc == 0)) || ((\old(M_E) != 1) && (\old(T1_E) == T1_E)))))) || (((\old(M_E) != 1) && (E_2 == \old(E_2))) && ((((E_M == \old(E_M)) && (((((p_dw_pc == 0) && (\old(T1_E) == T1_E)) && (E_M != 0)) && (c_dr_pc == 0)) || (\old(T1_E) != \old(M_E)))) && (E_1 == \old(E_1))) || (((\old(E_1) != \old(M_E)) && (E_M == \old(E_M))) && ((\old(T1_E) == T1_E) || (\old(T1_E) != \old(M_E)))))))) || (((E_M == \old(E_M)) && (\old(M_E) != 0)) && (M_E == 2)))) && (((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (token == \old(token))) && (local == \old(local)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 16:22:10,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE