./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 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx --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.3-dev-527bcce [2023-11-21 21:01:30,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:01:30,180 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 21:01:30,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:01:30,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:01:30,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:01:30,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:01:30,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:01:30,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:01:30,221 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:01:30,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:01:30,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:01:30,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:01:30,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:01:30,225 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:01:30,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:01:30,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:01:30,226 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:01:30,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:01:30,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:01:30,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:01:30,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:01:30,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:01:30,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:01:30,236 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:01:30,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:01:30,237 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:01:30,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:01:30,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:01:30,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:01:30,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:01:30,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:30,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:01:30,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:01:30,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:01:30,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:01:30,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:01:30,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:01:30,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:01:30,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:01:30,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:01:30,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:01:30,245 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx 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 [2023-11-21 21:01:30,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:01:30,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:01:30,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:01:30,547 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:01:30,548 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:01:30,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-11-21 21:01:33,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:01:34,008 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:01:34,009 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-11-21 21:01:34,023 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/data/511792862/fda20bc997524d4a9345fbf2a51de774/FLAG0e4aae4f2 [2023-11-21 21:01:34,042 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/data/511792862/fda20bc997524d4a9345fbf2a51de774 [2023-11-21 21:01:34,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:01:34,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:01:34,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:34,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:01:34,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:01:34,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e3d76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34, skipping insertion in model container [2023-11-21 21:01:34,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,130 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:01:34,356 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2023-11-21 21:01:34,434 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-11-21 21:01:34,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:34,483 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:01:34,496 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2023-11-21 21:01:34,526 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2023-11-21 21:01:34,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:34,569 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:01:34,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34 WrapperNode [2023-11-21 21:01:34,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:34,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:34,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:01:34,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:01:34,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,632 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 448 [2023-11-21 21:01:34,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:34,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:01:34,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:01:34,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:01:34,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,651 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,666 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 21:01:34,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:01:34,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:01:34,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:01:34,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:01:34,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (1/1) ... [2023-11-21 21:01:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:34,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:34,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:01:34,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:01:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-21 21:01:34,796 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-21 21:01:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-21 21:01:34,796 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-21 21:01:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-21 21:01:34,796 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-21 21:01:34,796 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-21 21:01:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-21 21:01:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-21 21:01:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-21 21:01:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-21 21:01:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-21 21:01:34,797 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-21 21:01:34,797 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-21 21:01:34,799 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-21 21:01:34,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-21 21:01:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-21 21:01:34,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-21 21:01:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-21 21:01:34,801 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-21 21:01:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-21 21:01:34,801 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-21 21:01:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:01:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-21 21:01:34,803 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-21 21:01:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-21 21:01:34,804 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-21 21:01:34,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:01:34,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:01:34,804 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-21 21:01:34,804 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-21 21:01:34,929 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:01:34,931 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:01:35,449 INFO L774 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-11-21 21:01:35,450 INFO L774 $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; [2023-11-21 21:01:35,509 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:01:35,788 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:01:35,789 INFO L308 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-21 21:01:35,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:35 BoogieIcfgContainer [2023-11-21 21:01:35,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:01:35,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:01:35,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:01:35,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:01:35,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:01:34" (1/3) ... [2023-11-21 21:01:35,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5031e205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:01:35, skipping insertion in model container [2023-11-21 21:01:35,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:34" (2/3) ... [2023-11-21 21:01:35,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5031e205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:01:35, skipping insertion in model container [2023-11-21 21:01:35,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:35" (3/3) ... [2023-11-21 21:01:35,804 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2023-11-21 21:01:35,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:01:35,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 21:01:35,878 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:01:35,884 INFO L357 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, mHoare=true, 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;@7c9a0641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:01:35,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 21:01:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 100 states have (on average 1.47) internal successors, (147), 106 states have internal predecessors, (147), 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) [2023-11-21 21:01:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 21:01:35,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:35,918 INFO L195 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] [2023-11-21 21:01:35,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:35,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash 868430704, now seen corresponding path program 1 times [2023-11-21 21:01:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364176505] [2023-11-21 21:01:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364176505] [2023-11-21 21:01:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364176505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:36,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:36,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:01:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474398804] [2023-11-21 21:01:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:36,654 INFO L87 Difference]: Start difference. First operand has 148 states, 100 states have (on average 1.47) internal successors, (147), 106 states have internal predecessors, (147), 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 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-21 21:01:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:37,953 INFO L93 Difference]: Finished difference Result 456 states and 658 transitions. [2023-11-21 21:01:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 21:01:37,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 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 34 [2023-11-21 21:01:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:37,970 INFO L225 Difference]: With dead ends: 456 [2023-11-21 21:01:37,970 INFO L226 Difference]: Without dead ends: 306 [2023-11-21 21:01:37,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-21 21:01:37,983 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 511 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:37,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 466 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-21 21:01:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-11-21 21:01:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2023-11-21 21:01:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 203 states have (on average 1.3201970443349753) internal successors, (268), 210 states have internal predecessors, (268), 62 states have call successors, (62), 32 states have call predecessors, (62), 31 states have return successors, (74), 57 states have call predecessors, (74), 60 states have call successors, (74) [2023-11-21 21:01:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 404 transitions. [2023-11-21 21:01:38,100 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 404 transitions. Word has length 34 [2023-11-21 21:01:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:38,100 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 404 transitions. [2023-11-21 21:01:38,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-21 21:01:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 404 transitions. [2023-11-21 21:01:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-21 21:01:38,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:38,111 INFO L195 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] [2023-11-21 21:01:38,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:01:38,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:38,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash -637850763, now seen corresponding path program 1 times [2023-11-21 21:01:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241826146] [2023-11-21 21:01:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 21:01:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-21 21:01:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-21 21:01:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:38,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241826146] [2023-11-21 21:01:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241826146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:01:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827731064] [2023-11-21 21:01:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:38,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:38,324 INFO L87 Difference]: Start difference. First operand 298 states and 404 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:01:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:38,993 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2023-11-21 21:01:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 21:01:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 5 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 44 [2023-11-21 21:01:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:39,004 INFO L225 Difference]: With dead ends: 432 [2023-11-21 21:01:39,004 INFO L226 Difference]: Without dead ends: 361 [2023-11-21 21:01:39,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:01:39,013 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 352 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:39,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 492 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 21:01:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-21 21:01:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2023-11-21 21:01:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 244 states have (on average 1.319672131147541) internal successors, (322), 251 states have internal predecessors, (322), 72 states have call successors, (72), 39 states have call predecessors, (72), 38 states have return successors, (84), 67 states have call predecessors, (84), 70 states have call successors, (84) [2023-11-21 21:01:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 478 transitions. [2023-11-21 21:01:39,115 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 478 transitions. Word has length 44 [2023-11-21 21:01:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:39,116 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 478 transitions. [2023-11-21 21:01:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:01:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 478 transitions. [2023-11-21 21:01:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-21 21:01:39,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:39,121 INFO L195 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] [2023-11-21 21:01:39,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:01:39,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:39,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 283067342, now seen corresponding path program 1 times [2023-11-21 21:01:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84680837] [2023-11-21 21:01:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-21 21:01:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84680837] [2023-11-21 21:01:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84680837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:39,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 21:01:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320670089] [2023-11-21 21:01:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:39,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:01:39,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:01:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:39,371 INFO L87 Difference]: Start difference. First operand 356 states and 478 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:01:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:40,817 INFO L93 Difference]: Finished difference Result 778 states and 1062 transitions. [2023-11-21 21:01:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 21:01:40,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 5 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 45 [2023-11-21 21:01:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:40,823 INFO L225 Difference]: With dead ends: 778 [2023-11-21 21:01:40,824 INFO L226 Difference]: Without dead ends: 421 [2023-11-21 21:01:40,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2023-11-21 21:01:40,831 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 625 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:40,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 840 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-21 21:01:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-11-21 21:01:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 402. [2023-11-21 21:01:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 273 states have (on average 1.2783882783882783) internal successors, (349), 280 states have internal predecessors, (349), 82 states have call successors, (82), 46 states have call predecessors, (82), 45 states have return successors, (97), 77 states have call predecessors, (97), 80 states have call successors, (97) [2023-11-21 21:01:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 528 transitions. [2023-11-21 21:01:40,919 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 528 transitions. Word has length 45 [2023-11-21 21:01:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:40,920 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 528 transitions. [2023-11-21 21:01:40,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:01:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 528 transitions. [2023-11-21 21:01:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-21 21:01:40,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:40,924 INFO L195 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] [2023-11-21 21:01:40,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:01:40,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:40,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1180030747, now seen corresponding path program 1 times [2023-11-21 21:01:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538820973] [2023-11-21 21:01:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-21 21:01:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 21:01:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538820973] [2023-11-21 21:01:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538820973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:41,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:41,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 21:01:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309615373] [2023-11-21 21:01:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:41,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:01:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:01:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:41,182 INFO L87 Difference]: Start difference. First operand 402 states and 528 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:01:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:41,849 INFO L93 Difference]: Finished difference Result 686 states and 884 transitions. [2023-11-21 21:01:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:01:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2023-11-21 21:01:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:41,853 INFO L225 Difference]: With dead ends: 686 [2023-11-21 21:01:41,854 INFO L226 Difference]: Without dead ends: 512 [2023-11-21 21:01:41,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2023-11-21 21:01:41,856 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 602 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:41,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 315 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 21:01:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-11-21 21:01:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 504. [2023-11-21 21:01:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 341 states have (on average 1.2697947214076246) internal successors, (433), 348 states have internal predecessors, (433), 102 states have call successors, (102), 60 states have call predecessors, (102), 59 states have return successors, (120), 97 states have call predecessors, (120), 100 states have call successors, (120) [2023-11-21 21:01:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 655 transitions. [2023-11-21 21:01:41,942 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 655 transitions. Word has length 46 [2023-11-21 21:01:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:41,942 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 655 transitions. [2023-11-21 21:01:41,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:01:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 655 transitions. [2023-11-21 21:01:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-21 21:01:41,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:41,944 INFO L195 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] [2023-11-21 21:01:41,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:01:41,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:41,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash 495727131, now seen corresponding path program 1 times [2023-11-21 21:01:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:41,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543552282] [2023-11-21 21:01:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:01:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-21 21:01:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 21:01:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543552282] [2023-11-21 21:01:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543552282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:42,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:01:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397113583] [2023-11-21 21:01:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:42,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:01:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:42,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:01:42,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:01:42,038 INFO L87 Difference]: Start difference. First operand 504 states and 655 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:01:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:42,404 INFO L93 Difference]: Finished difference Result 769 states and 1005 transitions. [2023-11-21 21:01:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:01:42,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 5 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 47 [2023-11-21 21:01:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:42,408 INFO L225 Difference]: With dead ends: 769 [2023-11-21 21:01:42,408 INFO L226 Difference]: Without dead ends: 223 [2023-11-21 21:01:42,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:42,411 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 249 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:42,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 228 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:01:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-21 21:01:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2023-11-21 21:01:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 156 states have internal predecessors, (194), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (60), 43 states have call predecessors, (60), 46 states have call successors, (60) [2023-11-21 21:01:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 300 transitions. [2023-11-21 21:01:42,447 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 300 transitions. Word has length 47 [2023-11-21 21:01:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:42,448 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 300 transitions. [2023-11-21 21:01:42,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:01:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 300 transitions. [2023-11-21 21:01:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-21 21:01:42,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:42,451 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:01:42,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:01:42,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:42,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1246875632, now seen corresponding path program 1 times [2023-11-21 21:01:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548580258] [2023-11-21 21:01:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-21 21:01:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:01:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:42,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548580258] [2023-11-21 21:01:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548580258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:42,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:42,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 21:01:42,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075035235] [2023-11-21 21:01:42,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:42,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 21:01:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 21:01:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:42,779 INFO L87 Difference]: Start difference. First operand 223 states and 300 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-21 21:01:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:43,211 INFO L93 Difference]: Finished difference Result 590 states and 790 transitions. [2023-11-21 21:01:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:01:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 60 [2023-11-21 21:01:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:43,215 INFO L225 Difference]: With dead ends: 590 [2023-11-21 21:01:43,215 INFO L226 Difference]: Without dead ends: 374 [2023-11-21 21:01:43,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2023-11-21 21:01:43,217 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 229 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:43,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 177 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:01:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-11-21 21:01:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 323. [2023-11-21 21:01:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 225 states have internal predecessors, (278), 66 states have call successors, (66), 36 states have call predecessors, (66), 36 states have return successors, (84), 62 states have call predecessors, (84), 66 states have call successors, (84) [2023-11-21 21:01:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 428 transitions. [2023-11-21 21:01:43,271 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 428 transitions. Word has length 60 [2023-11-21 21:01:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:43,271 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 428 transitions. [2023-11-21 21:01:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-21 21:01:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 428 transitions. [2023-11-21 21:01:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-21 21:01:43,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:43,274 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:01:43,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:01:43,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:43,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1831137045, now seen corresponding path program 1 times [2023-11-21 21:01:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:43,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537889380] [2023-11-21 21:01:43,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:43,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-21 21:01:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 21:01:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:43,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537889380] [2023-11-21 21:01:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537889380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:43,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:01:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228132771] [2023-11-21 21:01:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:01:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:01:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:01:43,386 INFO L87 Difference]: Start difference. First operand 323 states and 428 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 21:01:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:43,662 INFO L93 Difference]: Finished difference Result 646 states and 864 transitions. [2023-11-21 21:01:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:01:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2023-11-21 21:01:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:43,668 INFO L225 Difference]: With dead ends: 646 [2023-11-21 21:01:43,669 INFO L226 Difference]: Without dead ends: 381 [2023-11-21 21:01:43,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:43,671 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:43,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:01:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-21 21:01:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 347. [2023-11-21 21:01:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 245 states have internal predecessors, (304), 68 states have call successors, (68), 38 states have call predecessors, (68), 38 states have return successors, (86), 64 states have call predecessors, (86), 68 states have call successors, (86) [2023-11-21 21:01:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 458 transitions. [2023-11-21 21:01:43,752 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 458 transitions. Word has length 62 [2023-11-21 21:01:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:43,753 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 458 transitions. [2023-11-21 21:01:43,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-21 21:01:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 458 transitions. [2023-11-21 21:01:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-21 21:01:43,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:43,756 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:01:43,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:01:43,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:43,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1372770545, now seen corresponding path program 1 times [2023-11-21 21:01:43,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:43,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319721771] [2023-11-21 21:01:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-21 21:01:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-21 21:01:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-21 21:01:43,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319721771] [2023-11-21 21:01:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319721771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:43,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:01:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508787158] [2023-11-21 21:01:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:43,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:01:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:43,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:01:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:01:43,879 INFO L87 Difference]: Start difference. First operand 347 states and 458 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-21 21:01:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:44,199 INFO L93 Difference]: Finished difference Result 757 states and 1010 transitions. [2023-11-21 21:01:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:01:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 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 78 [2023-11-21 21:01:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:44,204 INFO L225 Difference]: With dead ends: 757 [2023-11-21 21:01:44,205 INFO L226 Difference]: Without dead ends: 467 [2023-11-21 21:01:44,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:44,208 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 91 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:44,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 200 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:01:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-11-21 21:01:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 461. [2023-11-21 21:01:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 320 states have (on average 1.253125) internal successors, (401), 326 states have internal predecessors, (401), 89 states have call successors, (89), 51 states have call predecessors, (89), 51 states have return successors, (111), 84 states have call predecessors, (111), 89 states have call successors, (111) [2023-11-21 21:01:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 601 transitions. [2023-11-21 21:01:44,280 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 601 transitions. Word has length 78 [2023-11-21 21:01:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:44,281 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 601 transitions. [2023-11-21 21:01:44,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-21 21:01:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 601 transitions. [2023-11-21 21:01:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-21 21:01:44,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:44,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:44,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:01:44,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:44,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 537093229, now seen corresponding path program 1 times [2023-11-21 21:01:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274037616] [2023-11-21 21:01:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-21 21:01:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 21:01:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-21 21:01:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-21 21:01:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274037616] [2023-11-21 21:01:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274037616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329096200] [2023-11-21 21:01:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:44,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 21:01:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:01:44,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 21:01:44,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329096200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:44,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-21 21:01:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766052977] [2023-11-21 21:01:44,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:44,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:44,718 INFO L87 Difference]: Start difference. First operand 461 states and 601 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-21 21:01:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:44,818 INFO L93 Difference]: Finished difference Result 829 states and 1093 transitions. [2023-11-21 21:01:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-11-21 21:01:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:44,822 INFO L225 Difference]: With dead ends: 829 [2023-11-21 21:01:44,822 INFO L226 Difference]: Without dead ends: 540 [2023-11-21 21:01:44,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:44,826 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 59 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:44,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 94 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 21:01:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-11-21 21:01:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 525. [2023-11-21 21:01:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 375 states have (on average 1.24) internal successors, (465), 380 states have internal predecessors, (465), 89 states have call successors, (89), 59 states have call predecessors, (89), 60 states have return successors, (109), 86 states have call predecessors, (109), 89 states have call successors, (109) [2023-11-21 21:01:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 663 transitions. [2023-11-21 21:01:44,910 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 663 transitions. Word has length 90 [2023-11-21 21:01:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:44,911 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 663 transitions. [2023-11-21 21:01:44,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-21 21:01:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 663 transitions. [2023-11-21 21:01:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-21 21:01:44,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:44,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:44,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:45,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:45,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -436395730, now seen corresponding path program 1 times [2023-11-21 21:01:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:45,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161479512] [2023-11-21 21:01:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-21 21:01:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 21:01:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-21 21:01:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-21 21:01:45,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161479512] [2023-11-21 21:01:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161479512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134547170] [2023-11-21 21:01:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:45,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:45,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:45,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:01:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:01:45,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-21 21:01:45,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:45,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134547170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:45,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:45,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-21 21:01:45,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847177930] [2023-11-21 21:01:45,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:45,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:45,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:45,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:45,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:45,506 INFO L87 Difference]: Start difference. First operand 525 states and 663 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-21 21:01:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:45,680 INFO L93 Difference]: Finished difference Result 951 states and 1218 transitions. [2023-11-21 21:01:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-11-21 21:01:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:45,685 INFO L225 Difference]: With dead ends: 951 [2023-11-21 21:01:45,685 INFO L226 Difference]: Without dead ends: 623 [2023-11-21 21:01:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-21 21:01:45,687 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 37 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-11-21 21:01:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 553. [2023-11-21 21:01:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 402 states have internal predecessors, (494), 92 states have call successors, (92), 62 states have call predecessors, (92), 63 states have return successors, (112), 89 states have call predecessors, (112), 92 states have call successors, (112) [2023-11-21 21:01:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 698 transitions. [2023-11-21 21:01:45,774 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 698 transitions. Word has length 90 [2023-11-21 21:01:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:45,774 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 698 transitions. [2023-11-21 21:01:45,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-21 21:01:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 698 transitions. [2023-11-21 21:01:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-21 21:01:45,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:45,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:45,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:45,999 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:45,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:45,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1893448561, now seen corresponding path program 2 times [2023-11-21 21:01:45,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:45,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374862407] [2023-11-21 21:01:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-21 21:01:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 21:01:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 21:01:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-21 21:01:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-21 21:01:46,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374862407] [2023-11-21 21:01:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374862407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760652099] [2023-11-21 21:01:46,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:01:46,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:46,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:46,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 21:01:46,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:01:46,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:01:46,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 21:01:46,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 21:01:46,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760652099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-21 21:01:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961153340] [2023-11-21 21:01:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:46,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:46,455 INFO L87 Difference]: Start difference. First operand 553 states and 698 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-21 21:01:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:46,569 INFO L93 Difference]: Finished difference Result 874 states and 1137 transitions. [2023-11-21 21:01:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2023-11-21 21:01:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:46,573 INFO L225 Difference]: With dead ends: 874 [2023-11-21 21:01:46,574 INFO L226 Difference]: Without dead ends: 518 [2023-11-21 21:01:46,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:46,576 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 43 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:46,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 174 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 21:01:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-11-21 21:01:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 509. [2023-11-21 21:01:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 367 states have (on average 1.2098092643051772) internal successors, (444), 372 states have internal predecessors, (444), 84 states have call successors, (84), 57 states have call predecessors, (84), 57 states have return successors, (98), 80 states have call predecessors, (98), 84 states have call successors, (98) [2023-11-21 21:01:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 626 transitions. [2023-11-21 21:01:46,659 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 626 transitions. Word has length 90 [2023-11-21 21:01:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:46,660 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 626 transitions. [2023-11-21 21:01:46,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-21 21:01:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 626 transitions. [2023-11-21 21:01:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-21 21:01:46,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:46,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:46,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:46,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:46,880 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:46,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1938838937, now seen corresponding path program 1 times [2023-11-21 21:01:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169635575] [2023-11-21 21:01:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-21 21:01:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-21 21:01:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 21:01:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-21 21:01:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-21 21:01:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169635575] [2023-11-21 21:01:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169635575] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794198819] [2023-11-21 21:01:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:47,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:47,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 21:01:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 21:01:47,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 21:01:47,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:47,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794198819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:47,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:47,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-21 21:01:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790648448] [2023-11-21 21:01:47,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:47,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:47,323 INFO L87 Difference]: Start difference. First operand 509 states and 626 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-21 21:01:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:47,460 INFO L93 Difference]: Finished difference Result 1201 states and 1478 transitions. [2023-11-21 21:01:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:47,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2023-11-21 21:01:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:47,465 INFO L225 Difference]: With dead ends: 1201 [2023-11-21 21:01:47,465 INFO L226 Difference]: Without dead ends: 699 [2023-11-21 21:01:47,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:01:47,467 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 33 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:47,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 150 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 21:01:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-11-21 21:01:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 566. [2023-11-21 21:01:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 410 states have (on average 1.2097560975609756) internal successors, (496), 416 states have internal predecessors, (496), 91 states have call successors, (91), 64 states have call predecessors, (91), 64 states have return successors, (105), 86 states have call predecessors, (105), 91 states have call successors, (105) [2023-11-21 21:01:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 692 transitions. [2023-11-21 21:01:47,578 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 692 transitions. Word has length 91 [2023-11-21 21:01:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:47,579 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 692 transitions. [2023-11-21 21:01:47,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-21 21:01:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 692 transitions. [2023-11-21 21:01:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-21 21:01:47,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:47,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:47,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:47,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-21 21:01:47,796 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:47,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1545650774, now seen corresponding path program 1 times [2023-11-21 21:01:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024544758] [2023-11-21 21:01:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-21 21:01:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-21 21:01:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-21 21:01:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-21 21:01:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-21 21:01:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024544758] [2023-11-21 21:01:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024544758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:01:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875013592] [2023-11-21 21:01:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:47,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:01:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:47,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:01:47,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:01:47,982 INFO L87 Difference]: Start difference. First operand 566 states and 692 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-21 21:01:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:48,570 INFO L93 Difference]: Finished difference Result 1572 states and 1936 transitions. [2023-11-21 21:01:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 21:01:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2023-11-21 21:01:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:48,577 INFO L225 Difference]: With dead ends: 1572 [2023-11-21 21:01:48,578 INFO L226 Difference]: Without dead ends: 1088 [2023-11-21 21:01:48,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:01:48,580 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 183 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:48,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 252 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:01:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-21 21:01:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1053. [2023-11-21 21:01:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 763 states have (on average 1.2228047182175623) internal successors, (933), 767 states have internal predecessors, (933), 171 states have call successors, (171), 118 states have call predecessors, (171), 118 states have return successors, (193), 168 states have call predecessors, (193), 171 states have call successors, (193) [2023-11-21 21:01:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1297 transitions. [2023-11-21 21:01:48,835 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1297 transitions. Word has length 93 [2023-11-21 21:01:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:48,835 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1297 transitions. [2023-11-21 21:01:48,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-21 21:01:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1297 transitions. [2023-11-21 21:01:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-21 21:01:48,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:48,839 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:48,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:01:48,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:48,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1944845237, now seen corresponding path program 1 times [2023-11-21 21:01:48,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171579693] [2023-11-21 21:01:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-21 21:01:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-21 21:01:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-21 21:01:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-21 21:01:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-21 21:01:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-21 21:01:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-21 21:01:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-21 21:01:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-21 21:01:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171579693] [2023-11-21 21:01:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171579693] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972816436] [2023-11-21 21:01:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:49,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:49,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:49,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 21:01:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 21:01:49,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 21:01:49,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972816436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-21 21:01:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950409801] [2023-11-21 21:01:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:49,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:01:49,352 INFO L87 Difference]: Start difference. First operand 1053 states and 1297 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-21 21:01:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:49,742 INFO L93 Difference]: Finished difference Result 2007 states and 2477 transitions. [2023-11-21 21:01:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 21:01:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2023-11-21 21:01:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:49,749 INFO L225 Difference]: With dead ends: 2007 [2023-11-21 21:01:49,749 INFO L226 Difference]: Without dead ends: 1021 [2023-11-21 21:01:49,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-21 21:01:49,753 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 55 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:49,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 503 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2023-11-21 21:01:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 961. [2023-11-21 21:01:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 697 states have (on average 1.2195121951219512) internal successors, (850), 701 states have internal predecessors, (850), 155 states have call successors, (155), 108 states have call predecessors, (155), 108 states have return successors, (175), 152 states have call predecessors, (175), 155 states have call successors, (175) [2023-11-21 21:01:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1180 transitions. [2023-11-21 21:01:49,942 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1180 transitions. Word has length 100 [2023-11-21 21:01:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:49,942 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1180 transitions. [2023-11-21 21:01:49,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-21 21:01:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1180 transitions. [2023-11-21 21:01:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-21 21:01:49,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:49,945 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:49,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:50,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:50,160 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:50,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1532347915, now seen corresponding path program 1 times [2023-11-21 21:01:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:50,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347649839] [2023-11-21 21:01:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-21 21:01:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-21 21:01:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 21:01:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-21 21:01:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-21 21:01:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-21 21:01:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-21 21:01:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-21 21:01:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-21 21:01:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347649839] [2023-11-21 21:01:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347649839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961202985] [2023-11-21 21:01:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:50,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:50,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:50,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:50,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 21:01:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:51,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-21 21:01:51,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 21:01:51,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961202985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:51,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:51,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2023-11-21 21:01:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520834159] [2023-11-21 21:01:51,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:01:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:51,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:01:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-11-21 21:01:51,385 INFO L87 Difference]: Start difference. First operand 961 states and 1180 transitions. Second operand has 9 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-21 21:01:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:52,025 INFO L93 Difference]: Finished difference Result 1870 states and 2308 transitions. [2023-11-21 21:01:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:01:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2023-11-21 21:01:52,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:52,036 INFO L225 Difference]: With dead ends: 1870 [2023-11-21 21:01:52,036 INFO L226 Difference]: Without dead ends: 1039 [2023-11-21 21:01:52,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2023-11-21 21:01:52,039 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 207 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:52,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 206 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 21:01:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2023-11-21 21:01:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 999. [2023-11-21 21:01:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 731 states have (on average 1.2038303693570451) internal successors, (880), 735 states have internal predecessors, (880), 155 states have call successors, (155), 112 states have call predecessors, (155), 112 states have return successors, (175), 152 states have call predecessors, (175), 155 states have call successors, (175) [2023-11-21 21:01:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1210 transitions. [2023-11-21 21:01:52,230 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1210 transitions. Word has length 103 [2023-11-21 21:01:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:52,231 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1210 transitions. [2023-11-21 21:01:52,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-21 21:01:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1210 transitions. [2023-11-21 21:01:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-21 21:01:52,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:52,234 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-21 21:01:52,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:52,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:52,448 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:52,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1824968659, now seen corresponding path program 1 times [2023-11-21 21:01:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833890894] [2023-11-21 21:01:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-21 21:01:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-21 21:01:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-21 21:01:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-21 21:01:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-21 21:01:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-21 21:01:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-21 21:01:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-21 21:01:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-21 21:01:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-21 21:01:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833890894] [2023-11-21 21:01:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833890894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116331692] [2023-11-21 21:01:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:52,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:52,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 21:01:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:53,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-21 21:01:53,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-21 21:01:53,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-21 21:01:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116331692] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:53,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-21 21:01:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 16 [2023-11-21 21:01:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628463945] [2023-11-21 21:01:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:53,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:01:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:01:53,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-11-21 21:01:53,336 INFO L87 Difference]: Start difference. First operand 999 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-21 21:01:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:53,781 INFO L93 Difference]: Finished difference Result 2433 states and 2949 transitions. [2023-11-21 21:01:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:01:53,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2023-11-21 21:01:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:53,788 INFO L225 Difference]: With dead ends: 2433 [2023-11-21 21:01:53,788 INFO L226 Difference]: Without dead ends: 1071 [2023-11-21 21:01:53,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-11-21 21:01:53,792 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 65 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:53,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 173 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-11-21 21:01:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1023. [2023-11-21 21:01:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 724 states have (on average 1.1533149171270718) internal successors, (835), 729 states have internal predecessors, (835), 177 states have call successors, (177), 122 states have call predecessors, (177), 121 states have return successors, (197), 172 states have call predecessors, (197), 177 states have call successors, (197) [2023-11-21 21:01:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1209 transitions. [2023-11-21 21:01:54,002 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1209 transitions. Word has length 104 [2023-11-21 21:01:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:54,003 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1209 transitions. [2023-11-21 21:01:54,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-21 21:01:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1209 transitions. [2023-11-21 21:01:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-21 21:01:54,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:54,008 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:54,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:54,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-21 21:01:54,228 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:54,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash -642477149, now seen corresponding path program 1 times [2023-11-21 21:01:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517044951] [2023-11-21 21:01:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-21 21:01:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-21 21:01:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-21 21:01:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-21 21:01:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-21 21:01:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-21 21:01:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-21 21:01:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-21 21:01:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-21 21:01:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-21 21:01:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-21 21:01:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-21 21:01:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-21 21:01:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 69 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-21 21:01:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517044951] [2023-11-21 21:01:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517044951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004160200] [2023-11-21 21:01:54,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:54,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:54,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:54,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:54,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 21:01:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:54,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-21 21:01:54,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-21 21:01:54,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004160200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2023-11-21 21:01:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234119408] [2023-11-21 21:01:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:54,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:54,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:01:54,913 INFO L87 Difference]: Start difference. First operand 1023 states and 1209 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-21 21:01:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:55,149 INFO L93 Difference]: Finished difference Result 1612 states and 1887 transitions. [2023-11-21 21:01:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:01:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2023-11-21 21:01:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:55,153 INFO L225 Difference]: With dead ends: 1612 [2023-11-21 21:01:55,153 INFO L226 Difference]: Without dead ends: 596 [2023-11-21 21:01:55,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-21 21:01:55,157 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 49 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:55,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 550 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:01:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-11-21 21:01:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 434. [2023-11-21 21:01:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 313 states have (on average 1.1182108626198084) internal successors, (350), 320 states have internal predecessors, (350), 67 states have call successors, (67), 49 states have call predecessors, (67), 53 states have return successors, (73), 65 states have call predecessors, (73), 67 states have call successors, (73) [2023-11-21 21:01:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 490 transitions. [2023-11-21 21:01:55,247 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 490 transitions. Word has length 160 [2023-11-21 21:01:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:55,248 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 490 transitions. [2023-11-21 21:01:55,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-21 21:01:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 490 transitions. [2023-11-21 21:01:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-21 21:01:55,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:01:55,251 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:55,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:55,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 21:01:55,472 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:01:55,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1645193159, now seen corresponding path program 2 times [2023-11-21 21:01:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812759826] [2023-11-21 21:01:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 21:01:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-21 21:01:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-21 21:01:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:01:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-21 21:01:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-21 21:01:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-21 21:01:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-21 21:01:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-21 21:01:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-21 21:01:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-21 21:01:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-21 21:01:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-21 21:01:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-21 21:01:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-21 21:01:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-21 21:01:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-21 21:01:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-21 21:01:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-21 21:01:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-11-21 21:01:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812759826] [2023-11-21 21:01:55,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812759826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873995232] [2023-11-21 21:01:55,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:01:55,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:55,630 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:55,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 21:01:55,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:01:55,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:01:55,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 21:01:55,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-21 21:01:55,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:01:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873995232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:55,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:01:55,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-21 21:01:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450013297] [2023-11-21 21:01:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:55,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:01:55,814 INFO L87 Difference]: Start difference. First operand 434 states and 490 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-21 21:01:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:55,914 INFO L93 Difference]: Finished difference Result 605 states and 687 transitions. [2023-11-21 21:01:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 161 [2023-11-21 21:01:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:01:55,916 INFO L225 Difference]: With dead ends: 605 [2023-11-21 21:01:55,916 INFO L226 Difference]: Without dead ends: 0 [2023-11-21 21:01:55,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:01:55,918 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 21:01:55,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 21:01:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-21 21:01:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-21 21:01:55,919 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) [2023-11-21 21:01:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-21 21:01:55,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2023-11-21 21:01:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:01:55,920 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-21 21:01:55,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-21 21:01:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-21 21:01:55,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-21 21:01:55,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-21 21:01:55,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-21 21:01:55,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:56,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-21 21:01:56,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-21 21:02:06,546 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2023-11-21 21:02:06,546 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2023-11-21 21:02:06,547 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 915 925) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse10 (< ~E_1~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~E_M~0 2))) (.cse3 (= |old(~m_st~0)| 0)) (.cse8 (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (.cse9 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (= ~token~0 ~local~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0)) .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) (not (= ~t1_pc~0 0)) .cse6 .cse7) (or .cse0 .cse3 .cse8 .cse9 .cse4 .cse5 .cse6 .cse10 (not (= (+ ~local~0 1) ~token~0)) (not (= ~E_M~0 1))) (or .cse0 .cse3 .cse8 .cse9 .cse4 .cse5 .cse6 .cse10 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse0 .cse2 .cse3 .cse8 .cse9 .cse4 .cse5 .cse6 .cse7)))) [2023-11-21 21:02:06,547 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2023-11-21 21:02:06,551 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: (let ((.cse5 (< ~p_dw_pc~0 1)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse2 (not (= ~p_dw_pc~0 0))) (.cse3 (= ~m_pc~0 1)) (.cse6 (not (= ~p_dw_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (not (= ~c_dr_pc~0 0)) .cse3 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse5 .cse4) (or .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse6))) [2023-11-21 21:02:06,552 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2023-11-21 21:02:06,552 INFO L899 garLoopResultBuilder]: For program point L733(lines 721 735) no Hoare annotation was computed. [2023-11-21 21:02:06,552 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2023-11-21 21:02:06,553 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 890 914) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (and .cse13 (= ~t1_st~0 0))) (.cse7 (not (= ~t1_pc~0 0))) (.cse12 (< ~E_1~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~E_M~0 2))) (.cse4 (= |old(~m_st~0)| 0)) (.cse10 (and (= |old(~t1_st~0)| ~t1_st~0) .cse13)) (.cse11 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 .cse8 .cse9) (or .cse1 .cse4 .cse10 .cse11 .cse5 .cse6 .cse8 .cse12 (not (= (+ ~local~0 1) ~token~0)) (not (= ~E_M~0 1))) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 (not (= ~E_1~0 2)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse4 .cse10 .cse11 .cse5 .cse6 .cse8 .cse12 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2))) (or .cse1 .cse3 .cse4 .cse10 .cse11 .cse5 .cse6 .cse8 .cse9)))) [2023-11-21 21:02:06,553 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2023-11-21 21:02:06,553 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2023-11-21 21:02:06,553 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2023-11-21 21:02:06,554 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2023-11-21 21:02:06,554 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2023-11-21 21:02:06,554 INFO L899 garLoopResultBuilder]: For program point L714(lines 702 716) no Hoare annotation was computed. [2023-11-21 21:02:06,554 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2023-11-21 21:02:06,554 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2023-11-21 21:02:06,555 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: (let ((.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (< ~p_dw_pc~0 1)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse7)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse2 (= ~m_pc~0 1)) (.cse5 (not (= ~p_dw_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4) (or .cse0 .cse6 .cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse7 (= ~p_dw_st~0 0)) .cse5 (not (= |old(~p_dw_st~0)| 0)))))) [2023-11-21 21:02:06,555 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (let ((.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (< ~p_dw_pc~0 1)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse7)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse2 (= ~m_pc~0 1)) (.cse5 (not (= ~p_dw_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4) (or .cse0 .cse6 .cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse7 (= ~p_dw_st~0 0)) .cse5 (not (= |old(~p_dw_st~0)| 0)))))) [2023-11-21 21:02:06,555 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~c_dr_pc~0 0))) (.cse3 (= ~m_pc~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse4 (< ~p_dw_pc~0 1)) (.cse5 (not (= ~p_dw_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (not (= ~p_dw_pc~0 0)) .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse2 .cse7) .cse5 .cse6) (or (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse0 .cse1 .cse3 .cse7 .cse4 .cse5))) [2023-11-21 21:02:06,556 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2023-11-21 21:02:06,556 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2023-11-21 21:02:06,556 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2023-11-21 21:02:06,556 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 834 861) the Hoare annotation is: (let ((.cse10 (= ~M_E~0 |old(~M_E~0)|)) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= ~E_M~0 2))) (let ((.cse1 (not (= 2 |old(~E_1~0)|))) (.cse3 (and .cse10 .cse11 .cse12 (= ~E_1~0 2))) (.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse8 (= ~m_st~0 0)) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= 2 |old(~E_M~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_pc~0 0)) .cse6 (not (= ~t1_st~0 0)) .cse7) (or .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse2 .cse4 .cse5 (< |old(~E_1~0)| 2) .cse6 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) (and .cse10 .cse11 (= ~E_1~0 |old(~E_1~0)|) .cse12))))) [2023-11-21 21:02:06,557 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2023-11-21 21:02:06,557 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_pc~0 0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (= ~m_pc~0 1)) (.cse3 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (< ~p_dw_pc~0 1)) (.cse5 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse5) (or .cse0 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse6 .cse4) (or .cse0 .cse2 .cse3 .cse6 .cse5))) [2023-11-21 21:02:06,557 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2023-11-21 21:02:06,557 INFO L899 garLoopResultBuilder]: For program point L124(lines 102 126) no Hoare annotation was computed. [2023-11-21 21:02:06,557 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2023-11-21 21:02:06,557 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2023-11-21 21:02:06,558 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2023-11-21 21:02:06,558 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2023-11-21 21:02:06,558 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2023-11-21 21:02:06,558 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2023-11-21 21:02:06,558 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2023-11-21 21:02:06,558 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2023-11-21 21:02:06,559 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-11-21 21:02:06,559 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2023-11-21 21:02:06,559 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 153 201) no Hoare annotation was computed. [2023-11-21 21:02:06,559 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,559 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2023-11-21 21:02:06,559 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2023-11-21 21:02:06,559 INFO L895 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,560 INFO L899 garLoopResultBuilder]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2023-11-21 21:02:06,560 INFO L899 garLoopResultBuilder]: For program point L799-1(lines 789 827) no Hoare annotation was computed. [2023-11-21 21:02:06,560 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2023-11-21 21:02:06,560 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1)))) (or (and .cse1 .cse2 (<= 1 ~p_dw_pc~0)) (and (= ~p_dw_pc~0 0) .cse1 .cse2))))) (or (and (= ~c_dr_pc~0 1) .cse0) (and (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) .cse0))) [2023-11-21 21:02:06,560 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 992 1050) no Hoare annotation was computed. [2023-11-21 21:02:06,560 INFO L899 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2023-11-21 21:02:06,560 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 619 662) no Hoare annotation was computed. [2023-11-21 21:02:06,561 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,561 INFO L899 garLoopResultBuilder]: For program point L471-1(line 471) no Hoare annotation was computed. [2023-11-21 21:02:06,561 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-11-21 21:02:06,561 INFO L895 garLoopResultBuilder]: At program point L1000(line 1000) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-11-21 21:02:06,561 INFO L899 garLoopResultBuilder]: For program point L1000-1(line 1000) no Hoare annotation was computed. [2023-11-21 21:02:06,562 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2023-11-21 21:02:06,562 INFO L899 garLoopResultBuilder]: For program point L802-2(lines 802 809) no Hoare annotation was computed. [2023-11-21 21:02:06,562 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2023-11-21 21:02:06,562 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 484 542) no Hoare annotation was computed. [2023-11-21 21:02:06,562 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2023-11-21 21:02:06,562 INFO L895 garLoopResultBuilder]: At program point L1002(line 1002) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-11-21 21:02:06,563 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-11-21 21:02:06,563 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 783 833) no Hoare annotation was computed. [2023-11-21 21:02:06,563 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,563 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2023-11-21 21:02:06,564 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2023-11-21 21:02:06,564 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2023-11-21 21:02:06,564 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-11-21 21:02:06,564 INFO L895 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~p_dw_st~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~token~0 ~local~0))) (or (and .cse0 (= ~t1_pc~0 0) .cse1 (not (= ~m_pc~0 1)) (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~t1_pc~0 1) .cse0 .cse1 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|) .cse2 .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,564 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2023-11-21 21:02:06,565 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,565 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 187) no Hoare annotation was computed. [2023-11-21 21:02:06,565 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 412 464) no Hoare annotation was computed. [2023-11-21 21:02:06,565 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-11-21 21:02:06,565 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,566 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,566 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2023-11-21 21:02:06,566 INFO L895 garLoopResultBuilder]: At program point L1007-1(lines 1007 1044) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,566 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,567 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 678 691) the Hoare annotation is: (let ((.cse5 (= ~token~0 ~local~0)) (.cse6 (= ~E_1~0 2)) (.cse7 (not (= ~m_pc~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse8 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse9 (= ~m_st~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~E_M~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse7 .cse2 (not .cse9) .cse3 .cse4) (and .cse0 .cse8 .cse1 (= (+ ~local~0 1) ~token~0) .cse9 .cse2 .cse3 .cse4))) [2023-11-21 21:02:06,567 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,567 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2023-11-21 21:02:06,568 INFO L895 garLoopResultBuilder]: At program point L813-1(lines 789 827) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 0))) (let ((.cse10 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse11 (not (= ~m_pc~0 1))) (.cse4 (= ~p_dw_st~0 0)) (.cse14 (not .cse13)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse12 .cse2 (= (+ ~local~0 1) ~token~0) .cse13 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse12 .cse2 .cse11 .cse4 .cse14 .cse5 .cse6)))) [2023-11-21 21:02:06,568 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 634 655) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse5 (<= 1 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 (= ~t1_pc~0 0) .cse3 .cse4 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-21 21:02:06,568 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2023-11-21 21:02:06,568 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2023-11-21 21:02:06,568 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0)) (and .cse1 .cse2 (<= 1 ~p_dw_pc~0)) (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 1)))) [2023-11-21 21:02:06,569 INFO L895 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,569 INFO L899 garLoopResultBuilder]: For program point L979-1(line 979) no Hoare annotation was computed. [2023-11-21 21:02:06,569 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2023-11-21 21:02:06,569 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2023-11-21 21:02:06,570 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,570 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2023-11-21 21:02:06,570 INFO L899 garLoopResultBuilder]: For program point L816-2(lines 816 823) no Hoare annotation was computed. [2023-11-21 21:02:06,570 INFO L895 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,570 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2023-11-21 21:02:06,570 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2023-11-21 21:02:06,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-21 21:02:06,571 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2023-11-21 21:02:06,571 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse5 (<= 1 ~p_dw_pc~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 0) .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse6))) [2023-11-21 21:02:06,571 INFO L899 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2023-11-21 21:02:06,571 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-21 21:02:06,572 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2023-11-21 21:02:06,572 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 (= ~E_M~0 1)))) [2023-11-21 21:02:06,572 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 179 187) no Hoare annotation was computed. [2023-11-21 21:02:06,572 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2023-11-21 21:02:06,572 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2023-11-21 21:02:06,573 INFO L895 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,573 INFO L895 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,573 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2023-11-21 21:02:06,573 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,574 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2023-11-21 21:02:06,574 INFO L899 garLoopResultBuilder]: For program point L492-1(line 492) no Hoare annotation was computed. [2023-11-21 21:02:06,574 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-21 21:02:06,574 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~t1_pc~0 0) .cse2 (= ~t1_st~0 0) .cse3 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6))) [2023-11-21 21:02:06,575 INFO L895 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 0))) (let ((.cse10 (<= 2 ~t1_st~0)) (.cse1 (= ~t1_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse11 (not (= ~m_pc~0 1))) (.cse4 (= ~p_dw_st~0 0)) (.cse14 (not .cse13)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 (<= 2 ~m_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse12 .cse2 (= (+ ~local~0 1) ~token~0) .cse13 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse12 .cse2 .cse11 .cse4 .cse14 .cse5 .cse6)))) [2023-11-21 21:02:06,575 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-11-21 21:02:06,575 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2023-11-21 21:02:06,575 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2023-11-21 21:02:06,575 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2023-11-21 21:02:06,576 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2023-11-21 21:02:06,576 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2023-11-21 21:02:06,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2023-11-21 21:02:06,576 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2023-11-21 21:02:06,576 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2023-11-21 21:02:06,577 INFO L899 garLoopResultBuilder]: For program point $Ultimate##115(lines 648 654) no Hoare annotation was computed. [2023-11-21 21:02:06,577 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-11-21 21:02:06,577 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2023-11-21 21:02:06,577 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2023-11-21 21:02:06,577 INFO L899 garLoopResultBuilder]: For program point L95(lines 73 97) no Hoare annotation was computed. [2023-11-21 21:02:06,578 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-11-21 21:02:06,578 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2023-11-21 21:02:06,578 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2023-11-21 21:02:06,578 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2023-11-21 21:02:06,578 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2023-11-21 21:02:06,578 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2023-11-21 21:02:06,579 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2023-11-21 21:02:06,579 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2023-11-21 21:02:06,579 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2023-11-21 21:02:06,584 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-11-21 21:02:06,584 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-11-21 21:02:06,584 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-11-21 21:02:06,584 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 763 782) the Hoare annotation is: true [2023-11-21 21:02:06,584 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2023-11-21 21:02:06,585 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_pc~0 0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (= ~m_pc~0 1)) (.cse3 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (< ~p_dw_pc~0 1)) (.cse5 (not (= ~c_dr_pc~0 1)))) (and (or .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse5) (or .cse0 (not (= ~c_dr_pc~0 0)) .cse2 .cse3 .cse6 .cse4) (or .cse0 .cse2 .cse3 .cse6 .cse5))) [2023-11-21 21:02:06,585 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2023-11-21 21:02:06,585 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2023-11-21 21:02:06,585 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 862 889) the Hoare annotation is: (let ((.cse10 (= ~M_E~0 |old(~M_E~0)|)) (.cse11 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (= ~E_M~0 2))) (let ((.cse1 (not (= 2 |old(~E_1~0)|))) (.cse3 (and .cse10 .cse11 .cse12 (= ~E_1~0 2))) (.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse8 (= ~m_st~0 0)) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= 2 |old(~E_M~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0)))) (and (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_pc~0 0)) .cse6 (not (= ~t1_st~0 0)) .cse7) (or .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse2 .cse4 .cse5 (< |old(~E_1~0)| 2) .cse6 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) (and .cse10 .cse11 (= ~E_1~0 |old(~E_1~0)|) .cse12))))) [2023-11-21 21:02:06,589 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:06,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 21:02:06,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-11-21 21:02:06,621 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-11-21 21:02:06,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:02:06 BoogieIcfgContainer [2023-11-21 21:02:06,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 21:02:06,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 21:02:06,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 21:02:06,631 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 21:02:06,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:35" (3/4) ... [2023-11-21 21:02:06,633 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-21 21:02:06,637 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-21 21:02:06,637 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-11-21 21:02:06,637 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-21 21:02:06,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-11-21 21:02:06,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-21 21:02:06,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-21 21:02:06,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-11-21 21:02:06,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-11-21 21:02:06,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-11-21 21:02:06,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-21 21:02:06,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-21 21:02:06,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-21 21:02:06,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-11-21 21:02:06,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-21 21:02:06,658 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2023-11-21 21:02:06,660 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2023-11-21 21:02:06,661 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-21 21:02:06,663 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-21 21:02:06,695 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((p_dw_pc == 0))) || (m_pc == 1)) || !((c_dr_pc == 1))) && (((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((c_dr_pc == 0))) || (m_pc == 1)) || (p_dw_pc < 1)) || !((p_dw_i == 1)))) && ((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || (m_pc == 1)) || (p_dw_pc < 1)) || !((c_dr_pc == 1)))) && ((((((!((m_pc == t1_pc)) || !((p_dw_st == 0))) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((p_dw_pc == 0))) || (m_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1)))) [2023-11-21 21:02:06,761 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((p_dw_pc == 0))) || (m_pc == 1)) || !((c_dr_pc == 1))) && (((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((c_dr_pc == 0))) || (m_pc == 1)) || (p_dw_pc < 1)) || !((p_dw_i == 1)))) && ((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || (m_pc == 1)) || (p_dw_pc < 1)) || !((c_dr_pc == 1)))) && ((((((!((m_pc == t1_pc)) || !((p_dw_st == 0))) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((p_dw_pc == 0))) || (m_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1)))) [2023-11-21 21:02:06,857 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 21:02:06,858 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/witness.yml [2023-11-21 21:02:06,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 21:02:06,859 INFO L158 Benchmark]: Toolchain (without parser) took 32811.07ms. Allocated memory was 165.7MB in the beginning and 721.4MB in the end (delta: 555.7MB). Free memory was 120.7MB in the beginning and 574.9MB in the end (delta: -454.2MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,860 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:02:06,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.72ms. Allocated memory is still 165.7MB. Free memory was 120.4MB in the beginning and 101.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.78ms. Allocated memory is still 165.7MB. Free memory was 101.5MB in the beginning and 98.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,861 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 95.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,862 INFO L158 Benchmark]: RCFGBuilder took 1094.39ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 81.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,866 INFO L158 Benchmark]: TraceAbstraction took 30834.54ms. Allocated memory was 165.7MB in the beginning and 721.4MB in the end (delta: 555.7MB). Free memory was 80.6MB in the beginning and 587.4MB in the end (delta: -506.9MB). Peak memory consumption was 306.9MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,867 INFO L158 Benchmark]: Witness Printer took 228.00ms. Allocated memory is still 721.4MB. Free memory was 587.4MB in the beginning and 574.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 21:02:06,871 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.32ms. Allocated memory is still 121.6MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.72ms. Allocated memory is still 165.7MB. Free memory was 120.4MB in the beginning and 101.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.78ms. Allocated memory is still 165.7MB. Free memory was 101.5MB in the beginning and 98.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 95.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1094.39ms. Allocated memory is still 165.7MB. Free memory was 95.5MB in the beginning and 81.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30834.54ms. Allocated memory was 165.7MB in the beginning and 721.4MB in the end (delta: 555.7MB). Free memory was 80.6MB in the beginning and 587.4MB in the end (delta: -506.9MB). Peak memory consumption was 306.9MB. Max. memory is 16.1GB. * Witness Printer took 228.00ms. Allocated memory is still 721.4MB. Free memory was 587.4MB in the beginning and 574.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 * 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, 148 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3622 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3456 mSDsluCounter, 5355 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3447 mSDsCounter, 1466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4492 IncrementalHoareTripleChecker+Invalid, 5958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1466 mSolverCounterUnsat, 1908 mSDtfsCounter, 4492 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1702 GetRequests, 1486 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=13, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 703 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 1609 PreInvPairs, 1873 NumberOfFragments, 3729 HoareAnnotationTreeSize, 1609 FomulaSimplifications, 30348 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 52 FomulaSimplificationsInter, 25273 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2563 ConstructedInterpolants, 0 QuantifiedInterpolants, 5587 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4039 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 1739/1815 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: 262]: Loop Invariant Derived loop invariant: (((((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((p_dw_pc == 0))) || (m_pc == 1)) || !((c_dr_pc == 1))) && (((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((c_dr_pc == 0))) || (m_pc == 1)) || (p_dw_pc < 1)) || !((p_dw_i == 1)))) && ((((!((m_pc == t1_pc)) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || (m_pc == 1)) || (p_dw_pc < 1)) || !((c_dr_pc == 1)))) && ((((((!((m_pc == t1_pc)) || !((p_dw_st == 0))) || ((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((p_dw_pc == 0))) || (m_pc == 1)) || !((c_dr_pc == p_dw_pc))) || !((p_dw_i == 1)))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || (((((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || ((((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 1))) || ((((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))) && (c_dr_pc == 1))) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1) && ((((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc)) || (((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))))) || (((c_dr_pc == 0) && (p_dw_i == 1)) && ((((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc)) || (((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1)))))) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2)) || (((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && (t1_st == 0)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2))) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2))) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (2 <= m_st)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (t1_i == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((p_dw_pc == 0) && (t1_pc == 0)) && (t1_i == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || (((((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || ((((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc)) && (c_dr_pc == 1))) || ((((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))) && (c_dr_pc == 1))) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (2 <= m_st)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((p_dw_pc == 0) && (t1_i == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((p_dw_pc == 0) && (2 <= E_1)) && (t1_i == 1)) && ((local + 1) == token)) && (m_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (E_M == 2))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))) && (c_dr_pc == 0)) || (((m_pc == t1_pc) && !((m_pc == 1))) && (1 <= p_dw_pc))) || ((((p_dw_pc == 0) && (m_pc == t1_pc)) && !((m_pc == 1))) && (c_dr_pc == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-21 21:02:06,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20555d42-fdd6-4eda-b458-6e7c2d651db1/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE