./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.01.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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 04:07:19,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 04:07:19,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 04:07:19,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 04:07:19,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 04:07:19,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 04:07:19,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 04:07:19,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 04:07:19,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 04:07:19,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 04:07:19,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 04:07:19,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 04:07:19,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 04:07:19,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 04:07:19,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 04:07:19,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 04:07:19,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 04:07:19,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 04:07:19,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 04:07:19,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 04:07:19,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 04:07:19,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 04:07:19,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 04:07:19,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 04:07:19,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 04:07:19,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 04:07:19,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 04:07:19,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 04:07:19,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 04:07:19,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 04:07:19,982 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2024-11-22 04:07:20,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 04:07:20,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 04:07:20,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 04:07:20,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 04:07:20,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 04:07:20,220 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.01.cil-1.c [2024-11-22 04:07:21,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 04:07:21,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 04:07:21,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-11-22 04:07:21,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661178ed1/9d673f24a8ee4d1abdda5098d0fba0b9/FLAGe2db32428 [2024-11-22 04:07:21,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661178ed1/9d673f24a8ee4d1abdda5098d0fba0b9 [2024-11-22 04:07:21,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 04:07:21,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 04:07:21,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 04:07:21,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 04:07:21,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 04:07:21,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:07:21" (1/1) ... [2024-11-22 04:07:21,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3084d0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:21, skipping insertion in model container [2024-11-22 04:07:21,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:07:21" (1/1) ... [2024-11-22 04:07:21,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 04:07:21,970 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.01.cil-1.c[911,924] [2024-11-22 04:07:22,034 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.01.cil-1.c[8416,8429] [2024-11-22 04:07:22,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 04:07:22,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 04:07:22,084 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.01.cil-1.c[911,924] [2024-11-22 04:07:22,105 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.01.cil-1.c[8416,8429] [2024-11-22 04:07:22,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 04:07:22,140 INFO L204 MainTranslator]: Completed translation [2024-11-22 04:07:22,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22 WrapperNode [2024-11-22 04:07:22,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 04:07:22,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 04:07:22,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 04:07:22,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 04:07:22,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,186 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 446 [2024-11-22 04:07:22,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 04:07:22,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 04:07:22,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 04:07:22,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 04:07:22,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,220 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-22 04:07:22,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 04:07:22,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 04:07:22,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 04:07:22,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 04:07:22,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (1/1) ... [2024-11-22 04:07:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 04:07:22,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:07:22,282 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-22 04:07:22,284 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-22 04:07:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 04:07:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-22 04:07:22,320 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-22 04:07:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-22 04:07:22,322 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-22 04:07:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-22 04:07:22,322 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-22 04:07:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-22 04:07:22,322 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-22 04:07:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-22 04:07:22,323 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-22 04:07:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-22 04:07:22,323 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-22 04:07:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-22 04:07:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-22 04:07:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-22 04:07:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-22 04:07:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-22 04:07:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-22 04:07:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-22 04:07:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-22 04:07:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-22 04:07:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-22 04:07:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 04:07:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-22 04:07:22,325 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-22 04:07:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-22 04:07:22,325 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-22 04:07:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 04:07:22,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 04:07:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-22 04:07:22,325 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-22 04:07:22,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 04:07:22,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 04:07:22,765 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-22 04:07:22,765 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-22 04:07:22,829 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-11-22 04:07:22,830 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 04:07:22,849 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 04:07:22,851 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-22 04:07:22,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:07:22 BoogieIcfgContainer [2024-11-22 04:07:22,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 04:07:22,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 04:07:22,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 04:07:22,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 04:07:22,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:07:21" (1/3) ... [2024-11-22 04:07:22,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a903022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:07:22, skipping insertion in model container [2024-11-22 04:07:22,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:22" (2/3) ... [2024-11-22 04:07:22,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a903022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:07:22, skipping insertion in model container [2024-11-22 04:07:22,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:07:22" (3/3) ... [2024-11-22 04:07:22,860 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-11-22 04:07:22,875 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 04:07:22,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 04:07:22,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 04:07:22,951 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;@5b242a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 04:07:22,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 04:07:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 226 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 184 states have internal predecessors, (272), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 04:07:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 04:07:22,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:22,965 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] [2024-11-22 04:07:22,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:22,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1365474951, now seen corresponding path program 1 times [2024-11-22 04:07:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:22,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067099359] [2024-11-22 04:07:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:23,330 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-22 04:07:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067099359] [2024-11-22 04:07:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067099359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378481868] [2024-11-22 04:07:23,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:23,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:23,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:23,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:23,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:23,365 INFO L87 Difference]: Start difference. First operand has 226 states, 178 states have (on average 1.5280898876404494) internal successors, (272), 184 states have internal predecessors, (272), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-22 04:07:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:23,867 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2024-11-22 04:07:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:07:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 57 [2024-11-22 04:07:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:23,882 INFO L225 Difference]: With dead ends: 534 [2024-11-22 04:07:23,883 INFO L226 Difference]: Without dead ends: 315 [2024-11-22 04:07:23,887 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-22 04:07:23,891 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 427 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:23,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 654 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 04:07:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-22 04:07:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2024-11-22 04:07:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 245 states have (on average 1.4326530612244899) internal successors, (351), 250 states have internal predecessors, (351), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2024-11-22 04:07:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2024-11-22 04:07:23,956 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 57 [2024-11-22 04:07:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:23,957 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2024-11-22 04:07:23,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-22 04:07:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2024-11-22 04:07:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 04:07:23,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:23,959 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] [2024-11-22 04:07:23,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 04:07:23,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 453522955, now seen corresponding path program 1 times [2024-11-22 04:07:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819462974] [2024-11-22 04:07:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:24,138 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-22 04:07:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819462974] [2024-11-22 04:07:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819462974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:24,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:24,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658483242] [2024-11-22 04:07:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:24,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:24,142 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:24,606 INFO L93 Difference]: Finished difference Result 605 states and 849 transitions. [2024-11-22 04:07:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 04:07:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-22 04:07:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:24,610 INFO L225 Difference]: With dead ends: 605 [2024-11-22 04:07:24,613 INFO L226 Difference]: Without dead ends: 418 [2024-11-22 04:07:24,615 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-22 04:07:24,618 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 407 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:24,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 961 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 04:07:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-22 04:07:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 395. [2024-11-22 04:07:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 315 states have (on average 1.4222222222222223) internal successors, (448), 321 states have internal predecessors, (448), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (53), 50 states have call predecessors, (53), 49 states have call successors, (53) [2024-11-22 04:07:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 552 transitions. [2024-11-22 04:07:24,657 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 552 transitions. Word has length 57 [2024-11-22 04:07:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 552 transitions. [2024-11-22 04:07:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 552 transitions. [2024-11-22 04:07:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 04:07:24,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:24,661 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] [2024-11-22 04:07:24,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 04:07:24,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:24,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1595864887, now seen corresponding path program 1 times [2024-11-22 04:07:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:24,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248776456] [2024-11-22 04:07:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:24,780 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-22 04:07:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248776456] [2024-11-22 04:07:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248776456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013249206] [2024-11-22 04:07:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:24,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:24,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:24,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:24,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:24,785 INFO L87 Difference]: Start difference. First operand 395 states and 552 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:25,033 INFO L93 Difference]: Finished difference Result 684 states and 960 transitions. [2024-11-22 04:07:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:07:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-22 04:07:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:25,040 INFO L225 Difference]: With dead ends: 684 [2024-11-22 04:07:25,040 INFO L226 Difference]: Without dead ends: 410 [2024-11-22 04:07:25,041 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-22 04:07:25,043 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 364 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:25,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 471 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 04:07:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-22 04:07:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 395. [2024-11-22 04:07:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 315 states have (on average 1.4126984126984128) internal successors, (445), 321 states have internal predecessors, (445), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (53), 50 states have call predecessors, (53), 49 states have call successors, (53) [2024-11-22 04:07:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 549 transitions. [2024-11-22 04:07:25,097 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 549 transitions. Word has length 57 [2024-11-22 04:07:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:25,097 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 549 transitions. [2024-11-22 04:07:25,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 549 transitions. [2024-11-22 04:07:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 04:07:25,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:25,100 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] [2024-11-22 04:07:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 04:07:25,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1801709131, now seen corresponding path program 1 times [2024-11-22 04:07:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55818494] [2024-11-22 04:07:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:25,165 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-22 04:07:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55818494] [2024-11-22 04:07:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55818494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:25,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:25,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126342562] [2024-11-22 04:07:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:25,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:25,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:25,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:25,168 INFO L87 Difference]: Start difference. First operand 395 states and 549 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:25,206 INFO L93 Difference]: Finished difference Result 677 states and 951 transitions. [2024-11-22 04:07:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 04:07:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-22 04:07:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:25,210 INFO L225 Difference]: With dead ends: 677 [2024-11-22 04:07:25,211 INFO L226 Difference]: Without dead ends: 404 [2024-11-22 04:07:25,212 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-22 04:07:25,213 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1194 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-22 04:07:25,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1194 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-22 04:07:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-22 04:07:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 324 states have (on average 1.4012345679012346) internal successors, (454), 330 states have internal predecessors, (454), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (53), 50 states have call predecessors, (53), 49 states have call successors, (53) [2024-11-22 04:07:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 558 transitions. [2024-11-22 04:07:25,243 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 558 transitions. Word has length 57 [2024-11-22 04:07:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:25,245 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 558 transitions. [2024-11-22 04:07:25,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 558 transitions. [2024-11-22 04:07:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 04:07:25,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:25,247 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] [2024-11-22 04:07:25,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 04:07:25,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:25,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1729322573, now seen corresponding path program 1 times [2024-11-22 04:07:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873288011] [2024-11-22 04:07:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:25,325 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-22 04:07:25,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873288011] [2024-11-22 04:07:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873288011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:25,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526909716] [2024-11-22 04:07:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:25,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:25,330 INFO L87 Difference]: Start difference. First operand 404 states and 558 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:25,678 INFO L93 Difference]: Finished difference Result 1708 states and 2407 transitions. [2024-11-22 04:07:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:07:25,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 57 [2024-11-22 04:07:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:25,686 INFO L225 Difference]: With dead ends: 1708 [2024-11-22 04:07:25,687 INFO L226 Difference]: Without dead ends: 1426 [2024-11-22 04:07:25,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-22 04:07:25,689 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 810 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:25,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 854 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 04:07:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-22 04:07:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1388. [2024-11-22 04:07:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1113 states have (on average 1.3737646001796946) internal successors, (1529), 1136 states have internal predecessors, (1529), 166 states have call successors, (166), 98 states have call predecessors, (166), 107 states have return successors, (226), 156 states have call predecessors, (226), 164 states have call successors, (226) [2024-11-22 04:07:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1921 transitions. [2024-11-22 04:07:25,801 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1921 transitions. Word has length 57 [2024-11-22 04:07:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:25,802 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1921 transitions. [2024-11-22 04:07:25,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-22 04:07:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1921 transitions. [2024-11-22 04:07:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 04:07:25,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:25,803 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-22 04:07:25,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 04:07:25,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -16721517, now seen corresponding path program 1 times [2024-11-22 04:07:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:25,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240745994] [2024-11-22 04:07:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:25,878 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-22 04:07:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:25,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240745994] [2024-11-22 04:07:25,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240745994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359383113] [2024-11-22 04:07:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:25,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:25,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:25,880 INFO L87 Difference]: Start difference. First operand 1388 states and 1921 transitions. 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-22 04:07:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:26,238 INFO L93 Difference]: Finished difference Result 1611 states and 2243 transitions. [2024-11-22 04:07:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:07:26,239 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-22 04:07:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:26,253 INFO L225 Difference]: With dead ends: 1611 [2024-11-22 04:07:26,254 INFO L226 Difference]: Without dead ends: 1507 [2024-11-22 04:07:26,255 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-22 04:07:26,256 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 294 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:26,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 703 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 04:07:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-11-22 04:07:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1500. [2024-11-22 04:07:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1203 states have (on average 1.3765586034912718) internal successors, (1656), 1228 states have internal predecessors, (1656), 179 states have call successors, (179), 105 states have call predecessors, (179), 116 states have return successors, (244), 170 states have call predecessors, (244), 177 states have call successors, (244) [2024-11-22 04:07:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2079 transitions. [2024-11-22 04:07:26,364 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2079 transitions. Word has length 65 [2024-11-22 04:07:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:26,365 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 2079 transitions. [2024-11-22 04:07:26,365 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-22 04:07:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2079 transitions. [2024-11-22 04:07:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 04:07:26,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:26,366 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-22 04:07:26,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 04:07:26,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:26,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1662167123, now seen corresponding path program 1 times [2024-11-22 04:07:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565111129] [2024-11-22 04:07:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:26,454 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-22 04:07:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565111129] [2024-11-22 04:07:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565111129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:26,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:26,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726684352] [2024-11-22 04:07:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:26,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:26,456 INFO L87 Difference]: Start difference. First operand 1500 states and 2079 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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-22 04:07:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:27,006 INFO L93 Difference]: Finished difference Result 1867 states and 2594 transitions. [2024-11-22 04:07:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 04:07:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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-22 04:07:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:27,015 INFO L225 Difference]: With dead ends: 1867 [2024-11-22 04:07:27,015 INFO L226 Difference]: Without dead ends: 1658 [2024-11-22 04:07:27,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-22 04:07:27,017 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 432 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:27,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1024 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 04:07:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-22 04:07:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1612. [2024-11-22 04:07:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1293 states have (on average 1.3781902552204177) internal successors, (1782), 1320 states have internal predecessors, (1782), 192 states have call successors, (192), 112 states have call predecessors, (192), 125 states have return successors, (265), 184 states have call predecessors, (265), 190 states have call successors, (265) [2024-11-22 04:07:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2239 transitions. [2024-11-22 04:07:27,113 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2239 transitions. Word has length 65 [2024-11-22 04:07:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:27,113 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2239 transitions. [2024-11-22 04:07:27,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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-22 04:07:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2239 transitions. [2024-11-22 04:07:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 04:07:27,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:27,115 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-22 04:07:27,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 04:07:27,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:27,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -366418987, now seen corresponding path program 1 times [2024-11-22 04:07:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:27,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910556897] [2024-11-22 04:07:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:27,150 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-22 04:07:27,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:27,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910556897] [2024-11-22 04:07:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910556897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:27,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:07:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825204460] [2024-11-22 04:07:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:27,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:07:27,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:07:27,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:07:27,152 INFO L87 Difference]: Start difference. First operand 1612 states and 2239 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-22 04:07:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:27,370 INFO L93 Difference]: Finished difference Result 2518 states and 3521 transitions. [2024-11-22 04:07:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:07:27,371 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-22 04:07:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:27,379 INFO L225 Difference]: With dead ends: 2518 [2024-11-22 04:07:27,380 INFO L226 Difference]: Without dead ends: 2203 [2024-11-22 04:07:27,381 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-22 04:07:27,382 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 400 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:27,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 783 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:07:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2024-11-22 04:07:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2180. [2024-11-22 04:07:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1751 states have (on average 1.375214163335237) internal successors, (2408), 1786 states have internal predecessors, (2408), 252 states have call successors, (252), 154 states have call predecessors, (252), 175 states have return successors, (350), 244 states have call predecessors, (350), 250 states have call successors, (350) [2024-11-22 04:07:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3010 transitions. [2024-11-22 04:07:27,484 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3010 transitions. Word has length 65 [2024-11-22 04:07:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:27,485 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3010 transitions. [2024-11-22 04:07:27,485 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-22 04:07:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3010 transitions. [2024-11-22 04:07:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-22 04:07:27,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:27,488 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-22 04:07:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 04:07:27,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -299730420, now seen corresponding path program 1 times [2024-11-22 04:07:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877560355] [2024-11-22 04:07:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:27,542 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-22 04:07:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877560355] [2024-11-22 04:07:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877560355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370756181] [2024-11-22 04:07:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:27,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:27,545 INFO L87 Difference]: Start difference. First operand 2180 states and 3010 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-22 04:07:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:27,652 INFO L93 Difference]: Finished difference Result 3083 states and 4274 transitions. [2024-11-22 04:07:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:07:27,652 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-22 04:07:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:27,661 INFO L225 Difference]: With dead ends: 3083 [2024-11-22 04:07:27,661 INFO L226 Difference]: Without dead ends: 2200 [2024-11-22 04:07:27,663 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-22 04:07:27,664 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1494 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-22 04:07:27,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1494 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2024-11-22 04:07:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2200. [2024-11-22 04:07:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1767 states have (on average 1.3689869835880022) internal successors, (2419), 1802 states have internal predecessors, (2419), 252 states have call successors, (252), 154 states have call predecessors, (252), 179 states have return successors, (357), 248 states have call predecessors, (357), 250 states have call successors, (357) [2024-11-22 04:07:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3028 transitions. [2024-11-22 04:07:27,763 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3028 transitions. Word has length 66 [2024-11-22 04:07:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:27,764 INFO L471 AbstractCegarLoop]: Abstraction has 2200 states and 3028 transitions. [2024-11-22 04:07:27,764 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-22 04:07:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3028 transitions. [2024-11-22 04:07:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-22 04:07:27,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:27,765 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-22 04:07:27,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 04:07:27,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:27,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1329089718, now seen corresponding path program 1 times [2024-11-22 04:07:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060122888] [2024-11-22 04:07:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:27,828 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-22 04:07:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060122888] [2024-11-22 04:07:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060122888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:27,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536976874] [2024-11-22 04:07:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:27,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:27,831 INFO L87 Difference]: Start difference. First operand 2200 states and 3028 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-22 04:07:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:28,423 INFO L93 Difference]: Finished difference Result 4761 states and 6564 transitions. [2024-11-22 04:07:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 04:07:28,424 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-22 04:07:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:28,435 INFO L225 Difference]: With dead ends: 4761 [2024-11-22 04:07:28,435 INFO L226 Difference]: Without dead ends: 2496 [2024-11-22 04:07:28,441 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-22 04:07:28,441 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 1110 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:28,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1666 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 04:07:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2024-11-22 04:07:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2116. [2024-11-22 04:07:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1683 states have (on average 1.352346999405823) internal successors, (2276), 1718 states have internal predecessors, (2276), 252 states have call successors, (252), 154 states have call predecessors, (252), 179 states have return successors, (345), 248 states have call predecessors, (345), 250 states have call successors, (345) [2024-11-22 04:07:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2873 transitions. [2024-11-22 04:07:28,568 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2873 transitions. Word has length 66 [2024-11-22 04:07:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:28,569 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2873 transitions. [2024-11-22 04:07:28,569 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-22 04:07:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2873 transitions. [2024-11-22 04:07:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 04:07:28,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:28,570 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-22 04:07:28,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 04:07:28,570 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:28,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1179344157, now seen corresponding path program 1 times [2024-11-22 04:07:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:28,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5581537] [2024-11-22 04:07:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:28,612 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-22 04:07:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5581537] [2024-11-22 04:07:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5581537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740936875] [2024-11-22 04:07:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:28,614 INFO L87 Difference]: Start difference. First operand 2116 states and 2873 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-22 04:07:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:28,727 INFO L93 Difference]: Finished difference Result 2980 states and 4021 transitions. [2024-11-22 04:07:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:07:28,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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 67 [2024-11-22 04:07:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:28,736 INFO L225 Difference]: With dead ends: 2980 [2024-11-22 04:07:28,736 INFO L226 Difference]: Without dead ends: 2161 [2024-11-22 04:07:28,739 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-22 04:07:28,739 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:28,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1450 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2024-11-22 04:07:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2024-11-22 04:07:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1719 states have (on average 1.3449680046538686) internal successors, (2312), 1754 states have internal predecessors, (2312), 252 states have call successors, (252), 154 states have call predecessors, (252), 188 states have return successors, (354), 257 states have call predecessors, (354), 250 states have call successors, (354) [2024-11-22 04:07:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2918 transitions. [2024-11-22 04:07:28,849 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2918 transitions. Word has length 67 [2024-11-22 04:07:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:28,849 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 2918 transitions. [2024-11-22 04:07:28,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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-22 04:07:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2918 transitions. [2024-11-22 04:07:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 04:07:28,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:28,851 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-22 04:07:28,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 04:07:28,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1729419745, now seen corresponding path program 1 times [2024-11-22 04:07:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628350791] [2024-11-22 04:07:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:28,956 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-22 04:07:28,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:28,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628350791] [2024-11-22 04:07:28,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628350791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:28,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:28,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:28,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266634839] [2024-11-22 04:07:28,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:28,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:28,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:28,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:28,959 INFO L87 Difference]: Start difference. First operand 2161 states and 2918 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-22 04:07:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:29,469 INFO L93 Difference]: Finished difference Result 3077 states and 4087 transitions. [2024-11-22 04:07:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 04:07:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 67 [2024-11-22 04:07:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:29,479 INFO L225 Difference]: With dead ends: 3077 [2024-11-22 04:07:29,479 INFO L226 Difference]: Without dead ends: 2300 [2024-11-22 04:07:29,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 04:07:29,483 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 431 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:29,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 724 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 04:07:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2024-11-22 04:07:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2170. [2024-11-22 04:07:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1728 states have (on average 1.3420138888888888) internal successors, (2319), 1761 states have internal predecessors, (2319), 253 states have call successors, (253), 155 states have call predecessors, (253), 187 states have return successors, (349), 258 states have call predecessors, (349), 251 states have call successors, (349) [2024-11-22 04:07:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2921 transitions. [2024-11-22 04:07:29,624 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2921 transitions. Word has length 67 [2024-11-22 04:07:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:29,624 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 2921 transitions. [2024-11-22 04:07:29,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-22 04:07:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2921 transitions. [2024-11-22 04:07:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 04:07:29,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:29,626 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-22 04:07:29,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 04:07:29,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1863433251, now seen corresponding path program 1 times [2024-11-22 04:07:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527808564] [2024-11-22 04:07:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:29,663 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-22 04:07:29,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527808564] [2024-11-22 04:07:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527808564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:07:29,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974041770] [2024-11-22 04:07:29,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:07:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:29,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:07:29,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:07:29,665 INFO L87 Difference]: Start difference. First operand 2170 states and 2921 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 04:07:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:30,102 INFO L93 Difference]: Finished difference Result 3899 states and 5194 transitions. [2024-11-22 04:07:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 04:07:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2024-11-22 04:07:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:30,117 INFO L225 Difference]: With dead ends: 3899 [2024-11-22 04:07:30,117 INFO L226 Difference]: Without dead ends: 3029 [2024-11-22 04:07:30,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-22 04:07:30,121 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 383 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:30,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 371 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 04:07:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2024-11-22 04:07:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3019. [2024-11-22 04:07:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2382 states have (on average 1.3190596137699413) internal successors, (3142), 2428 states have internal predecessors, (3142), 357 states have call successors, (357), 219 states have call predecessors, (357), 278 states have return successors, (526), 379 states have call predecessors, (526), 355 states have call successors, (526) [2024-11-22 04:07:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4025 transitions. [2024-11-22 04:07:30,338 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4025 transitions. Word has length 67 [2024-11-22 04:07:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:30,338 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 4025 transitions. [2024-11-22 04:07:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 04:07:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4025 transitions. [2024-11-22 04:07:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 04:07:30,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:30,341 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-22 04:07:30,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 04:07:30,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1942648213, now seen corresponding path program 1 times [2024-11-22 04:07:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32420614] [2024-11-22 04:07:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:30,369 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-22 04:07:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32420614] [2024-11-22 04:07:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32420614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 04:07:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415621404] [2024-11-22 04:07:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 04:07:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 04:07:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 04:07:30,372 INFO L87 Difference]: Start difference. First operand 3019 states and 4025 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-22 04:07:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:30,530 INFO L93 Difference]: Finished difference Result 4602 states and 6152 transitions. [2024-11-22 04:07:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 04:07:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-22 04:07:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:30,538 INFO L225 Difference]: With dead ends: 4602 [2024-11-22 04:07:30,538 INFO L226 Difference]: Without dead ends: 1277 [2024-11-22 04:07:30,546 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-22 04:07:30,546 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:30,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 278 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-11-22 04:07:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2024-11-22 04:07:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1026 states have (on average 1.3664717348927875) internal successors, (1402), 1046 states have internal predecessors, (1402), 150 states have call successors, (150), 90 states have call predecessors, (150), 100 states have return successors, (212), 142 states have call predecessors, (212), 150 states have call successors, (212) [2024-11-22 04:07:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1764 transitions. [2024-11-22 04:07:30,622 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1764 transitions. Word has length 68 [2024-11-22 04:07:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1764 transitions. [2024-11-22 04:07:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-22 04:07:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1764 transitions. [2024-11-22 04:07:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 04:07:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:30,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 04:07:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 04:07:30,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -897080964, now seen corresponding path program 1 times [2024-11-22 04:07:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861745965] [2024-11-22 04:07:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-22 04:07:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861745965] [2024-11-22 04:07:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861745965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 04:07:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276597956] [2024-11-22 04:07:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:30,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 04:07:30,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:07:30,679 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-22 04:07:30,680 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-22 04:07:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:30,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 04:07:30,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:07:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-22 04:07:30,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 04:07:30,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276597956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:30,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 04:07:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-22 04:07:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949513410] [2024-11-22 04:07:30,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:30,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 04:07:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:30,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 04:07:30,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:30,794 INFO L87 Difference]: Start difference. First operand 1277 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 04:07:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:30,935 INFO L93 Difference]: Finished difference Result 3672 states and 5110 transitions. [2024-11-22 04:07:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 04:07:30,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-11-22 04:07:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:30,944 INFO L225 Difference]: With dead ends: 3672 [2024-11-22 04:07:30,945 INFO L226 Difference]: Without dead ends: 1751 [2024-11-22 04:07:30,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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-22 04:07:30,950 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:30,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 394 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2024-11-22 04:07:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1751. [2024-11-22 04:07:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1413 states have (on average 1.353857041755131) internal successors, (1913), 1437 states have internal predecessors, (1913), 200 states have call successors, (200), 123 states have call predecessors, (200), 137 states have return successors, (286), 192 states have call predecessors, (286), 200 states have call successors, (286) [2024-11-22 04:07:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2399 transitions. [2024-11-22 04:07:31,049 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2399 transitions. Word has length 93 [2024-11-22 04:07:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:31,050 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2399 transitions. [2024-11-22 04:07:31,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 04:07:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2399 transitions. [2024-11-22 04:07:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 04:07:31,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:31,053 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 04:07:31,065 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-22 04:07:31,254 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,SelfDestructingSolverStorable14 [2024-11-22 04:07:31,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:31,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:31,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1489639605, now seen corresponding path program 1 times [2024-11-22 04:07:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216026764] [2024-11-22 04:07:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-22 04:07:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216026764] [2024-11-22 04:07:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216026764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 04:07:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829149035] [2024-11-22 04:07:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:31,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 04:07:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:07:31,317 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-22 04:07:31,320 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-22 04:07:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:31,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 04:07:31,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:07:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-22 04:07:31,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 04:07:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829149035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 04:07:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-22 04:07:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259212469] [2024-11-22 04:07:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 04:07:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 04:07:31,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:31,446 INFO L87 Difference]: Start difference. First operand 1751 states and 2399 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-22 04:07:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:31,559 INFO L93 Difference]: Finished difference Result 3756 states and 5216 transitions. [2024-11-22 04:07:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 04:07:31,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 137 [2024-11-22 04:07:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:31,568 INFO L225 Difference]: With dead ends: 3756 [2024-11-22 04:07:31,569 INFO L226 Difference]: Without dead ends: 2015 [2024-11-22 04:07:31,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 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-22 04:07:31,575 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 167 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-22 04:07:31,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-22 04:07:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2015. [2024-11-22 04:07:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1647 states have (on average 1.286581663630844) internal successors, (2119), 1671 states have internal predecessors, (2119), 206 states have call successors, (206), 144 states have call predecessors, (206), 161 states have return successors, (298), 201 states have call predecessors, (298), 206 states have call successors, (298) [2024-11-22 04:07:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2623 transitions. [2024-11-22 04:07:31,688 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2623 transitions. Word has length 137 [2024-11-22 04:07:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:31,689 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2623 transitions. [2024-11-22 04:07:31,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-22 04:07:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2623 transitions. [2024-11-22 04:07:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 04:07:31,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:31,692 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 04:07:31,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 04:07:31,895 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,SelfDestructingSolverStorable15 [2024-11-22 04:07:31,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 517964918, now seen corresponding path program 2 times [2024-11-22 04:07:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170007258] [2024-11-22 04:07:31,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 04:07:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:31,913 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 04:07:31,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 04:07:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-22 04:07:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:31,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170007258] [2024-11-22 04:07:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170007258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:31,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052836823] [2024-11-22 04:07:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:31,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:31,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:31,947 INFO L87 Difference]: Start difference. First operand 2015 states and 2623 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 04:07:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:32,108 INFO L93 Difference]: Finished difference Result 4037 states and 5402 transitions. [2024-11-22 04:07:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 04:07:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 137 [2024-11-22 04:07:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:32,123 INFO L225 Difference]: With dead ends: 4037 [2024-11-22 04:07:32,123 INFO L226 Difference]: Without dead ends: 2033 [2024-11-22 04:07:32,129 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-22 04:07:32,130 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 550 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-22 04:07:32,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 550 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2024-11-22 04:07:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2033. [2024-11-22 04:07:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1665 states have (on average 1.2654654654654656) internal successors, (2107), 1689 states have internal predecessors, (2107), 206 states have call successors, (206), 144 states have call predecessors, (206), 161 states have return successors, (298), 201 states have call predecessors, (298), 206 states have call successors, (298) [2024-11-22 04:07:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2611 transitions. [2024-11-22 04:07:32,312 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2611 transitions. Word has length 137 [2024-11-22 04:07:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:32,313 INFO L471 AbstractCegarLoop]: Abstraction has 2033 states and 2611 transitions. [2024-11-22 04:07:32,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 04:07:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2611 transitions. [2024-11-22 04:07:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 04:07:32,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:32,318 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] [2024-11-22 04:07:32,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 04:07:32,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:32,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1483346950, now seen corresponding path program 1 times [2024-11-22 04:07:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:32,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392937144] [2024-11-22 04:07:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-22 04:07:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392937144] [2024-11-22 04:07:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392937144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:32,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:32,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:07:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211042880] [2024-11-22 04:07:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:32,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:07:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:07:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:07:32,471 INFO L87 Difference]: Start difference. First operand 2033 states and 2611 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-22 04:07:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:32,769 INFO L93 Difference]: Finished difference Result 3551 states and 4551 transitions. [2024-11-22 04:07:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 04:07:32,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 137 [2024-11-22 04:07:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:32,779 INFO L225 Difference]: With dead ends: 3551 [2024-11-22 04:07:32,779 INFO L226 Difference]: Without dead ends: 2154 [2024-11-22 04:07:32,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-22 04:07:32,784 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 190 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:32,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 429 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 04:07:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2024-11-22 04:07:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2005. [2024-11-22 04:07:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1644 states have (on average 1.2603406326034063) internal successors, (2072), 1661 states have internal predecessors, (2072), 206 states have call successors, (206), 144 states have call predecessors, (206), 154 states have return successors, (283), 200 states have call predecessors, (283), 206 states have call successors, (283) [2024-11-22 04:07:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2561 transitions. [2024-11-22 04:07:32,926 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2561 transitions. Word has length 137 [2024-11-22 04:07:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:32,927 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2561 transitions. [2024-11-22 04:07:32,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-22 04:07:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2561 transitions. [2024-11-22 04:07:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 04:07:32,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:32,930 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] [2024-11-22 04:07:32,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 04:07:32,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 944911672, now seen corresponding path program 1 times [2024-11-22 04:07:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621666442] [2024-11-22 04:07:32,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-22 04:07:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621666442] [2024-11-22 04:07:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621666442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:33,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:33,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 04:07:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985154787] [2024-11-22 04:07:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:33,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 04:07:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 04:07:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:07:33,013 INFO L87 Difference]: Start difference. First operand 2005 states and 2561 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-22 04:07:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:33,240 INFO L93 Difference]: Finished difference Result 3849 states and 4909 transitions. [2024-11-22 04:07:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:07:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 137 [2024-11-22 04:07:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:33,256 INFO L225 Difference]: With dead ends: 3849 [2024-11-22 04:07:33,256 INFO L226 Difference]: Without dead ends: 1856 [2024-11-22 04:07:33,262 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-22 04:07:33,263 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 181 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:33,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 236 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:07:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-22 04:07:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1575. [2024-11-22 04:07:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1299 states have (on average 1.2055427251732103) internal successors, (1566), 1311 states have internal predecessors, (1566), 150 states have call successors, (150), 111 states have call predecessors, (150), 125 states have return successors, (192), 153 states have call predecessors, (192), 150 states have call successors, (192) [2024-11-22 04:07:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1908 transitions. [2024-11-22 04:07:33,348 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1908 transitions. Word has length 137 [2024-11-22 04:07:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:33,348 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1908 transitions. [2024-11-22 04:07:33,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-22 04:07:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1908 transitions. [2024-11-22 04:07:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 04:07:33,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:33,350 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] [2024-11-22 04:07:33,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 04:07:33,351 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:33,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash -362230726, now seen corresponding path program 1 times [2024-11-22 04:07:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:33,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373829447] [2024-11-22 04:07:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-22 04:07:33,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:33,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373829447] [2024-11-22 04:07:33,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373829447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 04:07:33,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543881587] [2024-11-22 04:07:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:33,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 04:07:33,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:07:33,409 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-22 04:07:33,411 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-22 04:07:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:33,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 04:07:33,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:07:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-22 04:07:33,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 04:07:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543881587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:33,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 04:07:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-22 04:07:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026640322] [2024-11-22 04:07:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:33,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 04:07:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 04:07:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:07:33,512 INFO L87 Difference]: Start difference. First operand 1575 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 04:07:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:33,615 INFO L93 Difference]: Finished difference Result 3129 states and 3808 transitions. [2024-11-22 04:07:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 04:07:33,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 137 [2024-11-22 04:07:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:33,622 INFO L225 Difference]: With dead ends: 3129 [2024-11-22 04:07:33,623 INFO L226 Difference]: Without dead ends: 1566 [2024-11-22 04:07:33,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 139 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-22 04:07:33,627 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 113 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:33,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 263 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-22 04:07:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-22 04:07:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1290 states have (on average 1.186046511627907) internal successors, (1530), 1302 states have internal predecessors, (1530), 150 states have call successors, (150), 111 states have call predecessors, (150), 125 states have return successors, (192), 153 states have call predecessors, (192), 150 states have call successors, (192) [2024-11-22 04:07:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1872 transitions. [2024-11-22 04:07:33,724 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1872 transitions. Word has length 137 [2024-11-22 04:07:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:33,725 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 1872 transitions. [2024-11-22 04:07:33,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-22 04:07:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1872 transitions. [2024-11-22 04:07:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 04:07:33,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:33,726 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-22 04:07:33,733 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-22 04:07:33,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 04:07:33,928 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:33,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 269783769, now seen corresponding path program 1 times [2024-11-22 04:07:33,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533958111] [2024-11-22 04:07:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-22 04:07:34,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533958111] [2024-11-22 04:07:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533958111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 04:07:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039376791] [2024-11-22 04:07:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:34,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 04:07:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:07:34,004 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-22 04:07:34,005 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-22 04:07:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:34,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 04:07:34,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:07:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-22 04:07:34,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 04:07:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039376791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 04:07:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-22 04:07:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152499632] [2024-11-22 04:07:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 04:07:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:34,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 04:07:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 04:07:34,105 INFO L87 Difference]: Start difference. First operand 1566 states and 1872 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 04:07:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:34,229 INFO L93 Difference]: Finished difference Result 3664 states and 4352 transitions. [2024-11-22 04:07:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 04:07:34,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2024-11-22 04:07:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:34,236 INFO L225 Difference]: With dead ends: 3664 [2024-11-22 04:07:34,236 INFO L226 Difference]: Without dead ends: 1060 [2024-11-22 04:07:34,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 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-22 04:07:34,243 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 107 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:34,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:07:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-22 04:07:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-22 04:07:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 867 states have (on average 1.1534025374855825) internal successors, (1000), 875 states have internal predecessors, (1000), 110 states have call successors, (110), 78 states have call predecessors, (110), 82 states have return successors, (124), 107 states have call predecessors, (124), 110 states have call successors, (124) [2024-11-22 04:07:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1234 transitions. [2024-11-22 04:07:34,339 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1234 transitions. Word has length 138 [2024-11-22 04:07:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:34,339 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1234 transitions. [2024-11-22 04:07:34,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 04:07:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1234 transitions. [2024-11-22 04:07:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 04:07:34,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:34,341 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-22 04:07:34,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 04:07:34,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 04:07:34,542 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:34,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 671392969, now seen corresponding path program 1 times [2024-11-22 04:07:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579774686] [2024-11-22 04:07:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-22 04:07:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579774686] [2024-11-22 04:07:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579774686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:34,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:34,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:07:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338326249] [2024-11-22 04:07:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:34,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:07:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:07:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:07:34,588 INFO L87 Difference]: Start difference. First operand 1060 states and 1234 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 04:07:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:34,713 INFO L93 Difference]: Finished difference Result 1890 states and 2221 transitions. [2024-11-22 04:07:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:07:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-22 04:07:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:34,718 INFO L225 Difference]: With dead ends: 1890 [2024-11-22 04:07:34,718 INFO L226 Difference]: Without dead ends: 1060 [2024-11-22 04:07:34,721 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-22 04:07:34,722 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 195 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:34,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 385 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:07:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-22 04:07:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-22 04:07:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 867 states have (on average 1.1395617070357555) internal successors, (988), 875 states have internal predecessors, (988), 110 states have call successors, (110), 78 states have call predecessors, (110), 82 states have return successors, (124), 107 states have call predecessors, (124), 110 states have call successors, (124) [2024-11-22 04:07:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1222 transitions. [2024-11-22 04:07:34,786 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1222 transitions. Word has length 139 [2024-11-22 04:07:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:34,786 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1222 transitions. [2024-11-22 04:07:34,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-22 04:07:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1222 transitions. [2024-11-22 04:07:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 04:07:34,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:07:34,788 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-22 04:07:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 04:07:34,788 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:07:34,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:07:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -787458929, now seen corresponding path program 1 times [2024-11-22 04:07:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:07:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059617375] [2024-11-22 04:07:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:07:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:07:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:07:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-22 04:07:34,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:07:34,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059617375] [2024-11-22 04:07:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059617375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:07:34,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:07:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:07:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783016414] [2024-11-22 04:07:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:07:34,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:07:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:07:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:07:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:07:34,904 INFO L87 Difference]: Start difference. First operand 1060 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-22 04:07:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:07:35,076 INFO L93 Difference]: Finished difference Result 1308 states and 1499 transitions. [2024-11-22 04:07:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:07:35,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 140 [2024-11-22 04:07:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:07:35,081 INFO L225 Difference]: With dead ends: 1308 [2024-11-22 04:07:35,081 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 04:07:35,084 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-22 04:07:35,084 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 206 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:07:35,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 409 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:07:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 04:07:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 04:07:35,085 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-22 04:07:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 04:07:35,088 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2024-11-22 04:07:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:07:35,088 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 04:07:35,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-22 04:07:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 04:07:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 04:07:35,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-22 04:07:35,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-22 04:07:35,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 04:07:35,095 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] [2024-11-22 04:07:35,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 04:07:54,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 04:07:54,927 WARN L156 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (let ((.cse8 (= ~t1_pc~0 1)) (.cse0 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse14 (= ~E_M~0 1)) (.cse9 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~t1_st~0)) (.cse12 (not .cse0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse13 (= ~m_pc~0 1)) (.cse17 (not .cse8)) (.cse18 (<= 2 ~m_st~0)) (.cse10 (= (+ ~local~0 1) ~token~0))) (and (let ((.cse7 (not .cse14)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (not .cse13)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= 2 |old(~m_st~0)|)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 (<= 2 |old(~t1_st~0)|) .cse3 .cse4 .cse5 .cse6 .cse9 .cse7) (and .cse8 (<= 2 ~E_1~0) .cse10 .cse1 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6))) (or .cse15 .cse16 .cse17 .cse14 (not .cse9)) (or .cse15 .cse12 .cse16 .cse13) (or .cse0 .cse18 (< |old(~m_st~0)| 2)) (or .cse17 .cse18 (not .cse10))))) Eliminated clause: (let ((.cse3 (= ~t1_pc~0 1))) (let ((.cse2 (= (+ ~local~0 1) ~token~0)) (.cse1 (not .cse3)) (.cse0 (< 1 ~m_st~0))) (and (or .cse0 .cse1 (not .cse2)) (exists ((|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse11 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse14 (not .cse11)) (.cse15 (= ~m_pc~0 1)) (.cse17 (< 1 ~t1_st~0)) (.cse18 (< |old(~t1_st~0)| 2)) (.cse16 (= ~E_M~0 1)) (.cse9 (= ~token~0 ~local~0))) (and (let ((.cse10 (not .cse16)) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (not .cse15)) (.cse13 (<= 2 |old(~m_st~0)|)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse3 .cse4 .cse5 (<= 2 |old(~t1_st~0)|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse10) (and .cse3 .cse4 (<= 2 ~E_1~0) .cse2 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse4 .cse14 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8))) (or .cse14 .cse17 .cse18 .cse15) (or .cse17 .cse18 .cse1 .cse16 (not .cse9)) (or .cse0 .cse11 (< |old(~m_st~0)| 2))))))))) [2024-11-22 04:07:54,957 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 04:07:54,970 WARN L156 FloydHoareUtils]: Requires clause for update_channels1 contained old-variable. Original clause: (and (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) [2024-11-22 04:07:55,046 WARN L156 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (let ((.cse14 (= |old(~m_st~0)| 0)) (.cse11 (= ~t1_pc~0 1)) (.cse23 (= ~m_pc~0 ~t1_pc~0)) (.cse25 (= ~token~0 ~local~0))) (let ((.cse8 (not .cse25)) (.cse0 (<= 2 ~m_st~0)) (.cse2 (< |old(~m_st~0)| 2)) (.cse1 (= ~m_pc~0 1)) (.cse5 (< ~E_1~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse26 (not .cse23)) (.cse4 (< |old(~t1_st~0)| 2)) (.cse6 (= ~E_M~0 1)) (.cse9 (= ~m_st~0 0)) (.cse7 (not .cse11)) (.cse10 (not .cse14)) (.cse13 (= (+ ~local~0 1) ~token~0))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6) (or .cse3 .cse4 .cse7 .cse6 .cse8) (or .cse9 .cse1 .cse10 .cse5 .cse8) (or .cse0 .cse2 .cse5) (let ((.cse16 (<= 2 |old(~t1_st~0)|)) (.cse21 (not .cse6)) (.cse24 (not .cse1)) (.cse12 (<= 2 ~E_1~0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= 2 |old(~m_st~0)|)) (.cse18 (not (= ~E_M~0 0))) (.cse19 (= ~p_dw_st~0 0)) (.cse20 (= ~c_dr_pc~0 0))) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse12 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse15 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse11 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21) (and .cse12 .cse15 .cse17 .cse22 .cse18 .cse19 .cse20 .cse25 .cse21) (and .cse12 .cse26 .cse15 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (and .cse15 .cse24 .cse17 .cse22 .cse18 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse15 .cse17 .cse22 .cse18 .cse19 .cse20))) (or .cse4 .cse9 .cse1 .cse10 .cse5) (or .cse3 .cse26 .cse4 .cse6) (or .cse9 .cse7 .cse10 (not .cse13))))) Eliminated clause: (exists ((|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse21 (= |old(~m_st~0)| 0)) (.cse15 (= ~t1_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (not .cse18)) (.cse4 (< 1 ~m_st~0)) (.cse5 (< |old(~m_st~0)| 2)) (.cse25 (not .cse17)) (.cse22 (= ~m_pc~0 1)) (.cse23 (= ~m_st~0 0)) (.cse26 (not .cse15)) (.cse24 (not .cse21)) (.cse20 (= (+ ~local~0 1) ~token~0)) (.cse1 (< 1 ~t1_st~0)) (.cse2 (< |old(~t1_st~0)| 2)) (.cse6 (< ~E_1~0 2)) (.cse3 (= ~E_M~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6) (let ((.cse19 (not .cse22)) (.cse16 (<= 2 |old(~t1_st~0)|)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse10 (<= 2 |old(~m_st~0)|)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (not .cse3))) (or (and .cse7 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse7 .cse9 .cse16 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse7 .cse18 .cse9 .cse19 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13) (and .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse7 .cse8 .cse20 .cse21 .cse9 .cse16 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14))) (or .cse23 .cse22 .cse24 .cse6 .cse25) (or .cse4 .cse22 .cse5) (or .cse1 .cse2 .cse26 .cse3 .cse25) (or .cse2 .cse23 .cse22 .cse24 .cse6) (or .cse23 .cse26 .cse24 (not .cse20)) (or .cse1 .cse2 .cse6 .cse3))))) [2024-11-22 04:07:55,114 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 04:07:55,120 WARN L156 FloydHoareUtils]: Requires clause for activate_threads1 contained old-variable. Original clause: (let ((.cse5 (= ~c_dr_pc~0 0))) (and (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) (or (= |old(~p_dw_st~0)| ~p_dw_st~0) (not .cse5)))) Eliminated clause: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) [2024-11-22 04:07:55,281 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (= ~m_st~0 0)) (.cse16 (not .cse17)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (< |old(~E_1~0)| 2))) (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (or .cse0 .cse1 .cse2 .cse3) (let ((.cse12 (= ~token~0 ~local~0)) (.cse13 (<= 2 ~t1_st~0)) (.cse4 (not .cse2)) (.cse9 (<= 2 |old(~E_1~0)|)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= |old(~E_M~0)| 0))) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse4 .cse1 .cse5 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse1 .cse5 .cse14 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse17 .cse13 .cse4 .cse5 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse17 .cse13 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse5 .cse15 .cse6 .cse7 .cse8 .cse10 .cse11))) (or .cse0 (not .cse14)) (or .cse0 .cse16 .cse2 .cse3) (or .cse0 (< ~t1_st~0 2) .cse2 .cse3)))) Eliminated clause: (let ((.cse0 (< 1 ~E_1~0)) (.cse1 (= ~m_st~0 0))) (and (or .cse0 (not .cse1)) (exists ((|old(~E_1~0)| Int)) (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (< |old(~E_1~0)| 2)) (.cse2 (not .cse17)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~E_M~0 1))) (and (or .cse2 .cse0 .cse3 .cse4) (or .cse5 .cse0 .cse3 .cse4) (or (< ~t1_st~0 2) .cse0 .cse3 .cse4) (let ((.cse16 (= ~token~0 ~local~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse10 (<= 2 |old(~E_1~0)|)) (.cse14 (not .cse4)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse15 (<= 2 ~m_st~0)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0))) (or (and .cse6 .cse7 .cse5 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14) (and .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse5 .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14) (and .cse7 (not .cse5) .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse17 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14) (and .cse17 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse9 .cse15 .cse11 .cse12 .cse13))))))))) [2024-11-22 04:07:55,328 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 04:07:55,334 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events1 contained old-variable. Original clause: (and (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) [2024-11-22 04:07:55,385 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events1 contained old-variable. Original clause: (and (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4))) [2024-11-22 04:07:55,428 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (= ~m_st~0 0)) (.cse16 (not .cse17)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (< |old(~E_1~0)| 2))) (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (or .cse0 .cse1 .cse2 .cse3) (let ((.cse12 (= ~token~0 ~local~0)) (.cse13 (<= 2 ~t1_st~0)) (.cse4 (not .cse2)) (.cse9 (<= 2 |old(~E_1~0)|)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= |old(~E_M~0)| 0))) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse13 .cse4 .cse1 .cse5 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse1 .cse5 .cse14 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse17 .cse13 .cse4 .cse5 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse17 .cse13 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse5 .cse15 .cse6 .cse7 .cse8 .cse10 .cse11))) (or .cse0 (not .cse14)) (or .cse0 .cse16 .cse2 .cse3) (or .cse0 (< ~t1_st~0 2) .cse2 .cse3)))) Eliminated clause: (let ((.cse0 (< 1 ~E_1~0)) (.cse1 (= ~m_st~0 0))) (and (or .cse0 (not .cse1)) (exists ((|old(~E_1~0)| Int)) (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (< |old(~E_1~0)| 2)) (.cse2 (not .cse17)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~E_M~0 1))) (and (or .cse2 .cse0 .cse3 .cse4) (or .cse5 .cse0 .cse3 .cse4) (or (< ~t1_st~0 2) .cse0 .cse3 .cse4) (let ((.cse16 (= ~token~0 ~local~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse10 (<= 2 |old(~E_1~0)|)) (.cse14 (not .cse4)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse15 (<= 2 ~m_st~0)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0))) (or (and .cse6 .cse7 .cse5 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14) (and .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse5 .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14) (and .cse7 (not .cse5) .cse8 .cse15 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse17 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14) (and .cse17 .cse6 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse9 .cse15 .cse11 .cse12 .cse13))))))))) [2024-11-22 04:07:55,480 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 04:07:55,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:07:55 BoogieIcfgContainer [2024-11-22 04:07:55,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 04:07:55,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 04:07:55,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 04:07:55,486 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 04:07:55,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:07:22" (3/4) ... [2024-11-22 04:07:55,489 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 04:07:55,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-22 04:07:55,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2024-11-22 04:07:55,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-22 04:07:55,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2024-11-22 04:07:55,494 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-22 04:07:55,506 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-22 04:07:55,507 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 04:07:55,510 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 04:07:55,510 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 04:07:55,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 04:07:55,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 04:07:55,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 04:07:55,647 INFO L158 Benchmark]: Toolchain (without parser) took 33877.95ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 118.6MB in the beginning and 1.1GB in the end (delta: -969.3MB). Peak memory consumption was 222.8MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,647 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 04:07:55,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.42ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 98.6MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 96.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,648 INFO L158 Benchmark]: Boogie Preprocessor took 62.03ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 92.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,648 INFO L158 Benchmark]: RCFGBuilder took 601.79ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 92.3MB in the beginning and 236.2MB in the end (delta: -143.9MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,648 INFO L158 Benchmark]: TraceAbstraction took 32628.83ms. Allocated memory was 276.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 235.1MB in the beginning and 1.1GB in the end (delta: -868.5MB). Peak memory consumption was 814.2MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,648 INFO L158 Benchmark]: Witness Printer took 163.50ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 04:07:55,649 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.16ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.42ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 98.6MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 96.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.03ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 92.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 601.79ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 92.3MB in the beginning and 236.2MB in the end (delta: -143.9MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 32628.83ms. Allocated memory was 276.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 235.1MB in the beginning and 1.1GB in the end (delta: -868.5MB). Peak memory consumption was 814.2MB. Max. memory is 16.1GB. * Witness Printer took 163.50ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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, 226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6705 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6542 mSDsluCounter, 15793 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10185 mSDsCounter, 870 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4727 IncrementalHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 870 mSolverCounterUnsat, 5608 mSDtfsCounter, 4727 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3019occurred in iteration=13, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 1109 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2581 NumberOfCodeBlocks, 2499 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2554 ConstructedInterpolants, 0 QuantifiedInterpolants, 3569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 899/943 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: 499]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) - InvariantResult [Line: 172]: Location Invariant Derived location invariant: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) - InvariantResult [Line: 634]: Location Invariant Derived location invariant: (((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) - InvariantResult [Line: 678]: Location Invariant Derived location invariant: (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1)) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 218]: Location Invariant Derived location invariant: (((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (M_E == 2)) - ProcedureContractResult [Line: 915]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Requires: (((1 < m_st) || (t1_pc != 1)) || (((long long) local + 1) != token)) Ensures: ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || ((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((p_dw_pc == 0) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) && ((((m_pc != 1) && (2 <= m_st)) || (m_pc == t1_pc)) || (\old(m_st) < 2))) && ((((m_pc != t1_pc) || (1 < t1_st)) || (\old(t1_st) < 2)) || (m_pc == 1))) && ((((1 < m_st) || ((m_st == 0) && (E_M == 1))) || (t1_pc != 1)) || (((long long) local + 1) != token))) && ((((((((((((((((((((((((((((((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))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 262]: Procedure Contract for update_channels1 Derived contract for procedure update_channels1. Requires: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 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))) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 890]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Ensures: (((((((((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1)) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || ((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (\old(m_st) == 0)) && (q_write_ev == q_read_ev)) && (2 <= \old(t1_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((m_pc != 1) && (2 <= \old(m_st)))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= \old(m_st))) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) && (((((2 <= t1_st) && (m_st == 0)) || (t1_pc != 1)) || (\old(m_st) != 0)) || (((long long) local + 1) != token))) && (((((m_pc != t1_pc) || (1 < t1_st)) || (\old(t1_st) < 2)) || (m_pc == 1)) || (E_M == 1))) && (((((m_st == 0) || (m_pc == 1)) || (\old(m_st) != 0)) || (E_1 < 2)) || (token != local))) && ((((((\old(t1_st) < 2) || (\old(m_st) < 2)) || (E_1 < 2)) || ((2 <= t1_st) && (2 <= m_st))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (E_M == 1))) && (((((\old(t1_st) < 2) || (m_st == 0)) || (m_pc == 1)) || (\old(m_st) != 0)) || (E_1 < 2))) && (((1 < m_st) || (m_pc == t1_pc)) || (\old(m_st) < 2))) && ((((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (m_pc == 1)) || (\old(m_st) < 2))) && ((((1 < m_st) || ((m_st == 0) && (E_M == 1))) || (\old(m_st) < 2)) || (((long long) local + 1) != token))) && ((((((2 <= t1_st) && (m_st == 0)) || (t1_pc != 1)) || (m_pc == 1)) || (\old(m_st) != 0)) || (E_1 < 2))) && ((((1 < m_st) || (\old(m_st) < 2)) || (E_1 < 2)) || (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))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 387]: Procedure Contract for activate_threads1 Derived contract for procedure activate_threads1. Requires: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((((((\old(p_dw_st) == p_dw_st) || (c_dr_pc == 1)) || (p_dw_pc == 1)) || (q_read_ev != 2)) && (((\old(p_dw_st) == p_dw_st) || (p_dw_pc == 1)) || (c_dr_pc != p_dw_pc))) && (((\old(p_dw_st) == p_dw_st) || (c_dr_pc != 0)) || (p_dw_st == 0))) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 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_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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 737]: Procedure Contract for update_channels2 Derived contract for procedure update_channels2. Requires: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) Ensures: (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 834]: Procedure Contract for fire_delta_events2 Derived contract for procedure fire_delta_events2. Requires: ((1 < E_1) || (m_st != 0)) Ensures: (((((((((((((T1_E == 2) || (\old(T1_E) != 2)) || (2 != \old(M_E))) && ((M_E == \old(M_E)) || (\old(M_E) == 0))) && ((((m_pc == t1_pc) || (1 < E_1)) || (\old(E_M) == 1)) || (\old(E_1) < 2))) && (((m_pc != 1) || (m_st != 0)) || (token != local))) && (E_M == \old(E_M))) && (((((m_st < 2) || (t1_pc != 1)) || (\old(E_M) == 1)) || (\old(E_1) < 2)) || ((((2 <= E_1) && (q_write_ev == q_read_ev)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && ((1 < E_1) || (m_st != 0))) && (E_M != 0)) && (((((((((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((2 <= t1_st) && (\old(E_M) != 1)) && (2 <= m_st)) && (c_dr_pc == p_dw_pc)) && (2 <= \old(E_1)))) || ((((((((p_dw_pc == 0) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((p_dw_pc == 0) && (m_pc != t1_pc)) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((p_dw_pc == 0) && (\old(E_M) != 1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)))) && (((((t1_st < 2) || (m_st < 2)) || (\old(E_M) == 1)) || (\old(E_1) < 2)) || ((((2 <= E_1) && (q_write_ev == q_read_ev)) && (p_dw_st == 0)) && (c_dr_pc == 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 315]: Procedure Contract for fire_delta_events1 Derived contract for procedure fire_delta_events1. Requires: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (\old(q_read_ev) == q_read_ev)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (M_E == 2)) && (\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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (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: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((\result == 0) || (c_dr_pc != 0)) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (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: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((((p_dw_pc == 1) || (\result == 0)) || (q_read_ev != 2)) && ((p_dw_pc != 0) || (\result == 0))) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 295]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. Requires: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 763]: Procedure Contract for exists_runnable_thread2 Derived contract for procedure exists_runnable_thread2. Requires: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) Ensures: (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_pc != t1_pc)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (E_M != 1))) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 333]: Procedure Contract for reset_delta_events1 Derived contract for procedure reset_delta_events1. Requires: (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (c_dr_pc == 1)) && (E_M != 0)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (c_dr_pc == 0)) && (M_E == 2))) Ensures: ((((((c_dr_pc == 1) || (c_dr_pc == 0)) && ((((c_dr_pc != 0) || (q_write_ev == 2)) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) && (((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) != 1)) || (c_dr_pc != 0)) || (\old(q_read_ev) != \old(q_write_ev))) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (q_read_ev == 2)) && (M_E == 2)))) && (((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (\old(q_read_ev) == q_read_ev)) && (M_E == 2)) || ((((((m_pc == t1_pc) && (T1_E == 2)) && (m_pc != 1)) && (E_M != 0)) && (q_read_ev == 2)) && (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_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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 862]: Procedure Contract for reset_delta_events2 Derived contract for procedure reset_delta_events2. Requires: ((1 < E_1) || (m_st != 0)) Ensures: ((((((((((((((((m_pc == t1_pc) || (T1_E == 2)) || (\old(T1_E) != 2)) || (\old(E_M) == 1)) || (\old(E_1) < 2)) || (2 != \old(M_E))) && (((M_E == \old(M_E)) && (E_M != 0)) || ((E_M != 0) && (M_E == 2)))) && (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (((long long) local + 1) == token)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) || (((((((p_dw_pc == 0) && (q_write_ev == q_read_ev)) && (m_pc != 1)) && (2 <= m_st)) && (\old(E_M) != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((((p_dw_pc == 0) && (\old(E_M) != 1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (t1_pc != 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local))) || ((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (m_pc == t1_pc)) && (q_write_ev == q_read_ev)) && (m_st == 0)) && (m_pc != 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((2 <= t1_st) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || ((((((((p_dw_pc == 0) && (m_pc != t1_pc)) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0))) || (((((((((p_dw_pc == 0) && (\old(E_M) != 1)) && (q_write_ev == q_read_ev)) && (2 <= m_st)) && (\old(E_M) != 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (token == local)))) && ((((((T1_E == 2) || (\old(T1_E) != 2)) || (t1_pc != 1)) || (\old(E_M) == 1)) || (\old(E_1) < 2)) || (2 != \old(M_E)))) && (((((m_pc == t1_pc) || ((E_M == \old(E_M)) && (((((2 <= E_1) && (M_E == \old(M_E))) && (\old(M_E) != 1)) && (\old(T1_E) == T1_E)) || (((2 <= E_1) && (M_E == \old(M_E))) && (\old(T1_E) != \old(M_E)))))) || (((2 <= E_1) && (E_M == \old(E_M))) && (M_E == 2))) || (\old(E_M) == 1)) || (\old(E_1) < 2))) && ((((((t1_st < 2) || (m_st < 2)) || ((E_M == \old(E_M)) && (((((((((p_dw_pc == 0) && (2 <= E_1)) && (M_E == \old(M_E))) && (q_write_ev == q_read_ev)) && (E_M != 0)) && (p_dw_st == 0)) && (\old(T1_E) != \old(M_E))) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (M_E == \old(M_E))) && (\old(M_E) != 1)) && (\old(T1_E) == T1_E)) && (q_write_ev == q_read_ev)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))))) || (((2 <= E_1) && (E_M == \old(E_M))) && (M_E == 2))) || (\old(E_M) == 1)) || (\old(E_1) < 2))) && ((((((t1_st < 2) || (T1_E == 2)) || (\old(T1_E) != 2)) || (\old(E_M) == 1)) || (\old(E_1) < 2)) || (2 != \old(M_E)))) && ((((T1_E == 2) || (\old(T1_E) != 2)) || (m_st != 0)) || (2 != \old(M_E)))) && ((((E_M == \old(E_M)) && (((((2 <= E_1) && (M_E == \old(M_E))) && (\old(M_E) != 1)) && (\old(T1_E) == T1_E)) || (((2 <= E_1) && (M_E == \old(M_E))) && (\old(T1_E) != \old(M_E))))) || (((2 <= E_1) && (E_M == \old(E_M))) && (M_E == 2))) || (m_st != 0))) && ((((((m_st < 2) || (t1_pc != 1)) || ((E_M == \old(E_M)) && (((((((((p_dw_pc == 0) && (2 <= E_1)) && (M_E == \old(M_E))) && (q_write_ev == q_read_ev)) && (E_M != 0)) && (p_dw_st == 0)) && (\old(T1_E) != \old(M_E))) && (c_dr_pc == 0)) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (M_E == \old(M_E))) && (\old(M_E) != 1)) && (\old(T1_E) == T1_E)) && (q_write_ev == q_read_ev)) && (E_M != 0)) && (p_dw_st == 0)) && (c_dr_pc == 0))))) || (((2 <= E_1) && (E_M == \old(E_M))) && (M_E == 2))) || (\old(E_M) == 1)) || (\old(E_1) < 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 04:07:55,688 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