./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ --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 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:31:01,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:31:01,564 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:31:01,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:31:01,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:31:01,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:31:01,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:31:01,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:31:01,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:31:01,599 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:31:01,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:31:01,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:31:01,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:31:01,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:31:01,603 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:31:01,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:31:01,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:31:01,605 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:31:01,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:31:01,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:31:01,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:31:01,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:31:01,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:31:01,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:31:01,608 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:31:01,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:31:01,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:31:01,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:31:01,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:31:01,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:31:01,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:31:01,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:31:01,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:31:01,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:31:01,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:31:01,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:31:01,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:31:01,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:31:01,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:31:01,615 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:31:01,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:31:01,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:31:01,617 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_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/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_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ 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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2023-11-23 22:31:01,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:31:01,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:31:01,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:31:01,944 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:31:01,945 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:31:01,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2023-11-23 22:31:05,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:31:05,443 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:31:05,453 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2023-11-23 22:31:05,475 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/data/c6fae17e5/f15704a0d32c4b33affa7327ad737f48/FLAG9eab71c04 [2023-11-23 22:31:05,494 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/data/c6fae17e5/f15704a0d32c4b33affa7327ad737f48 [2023-11-23 22:31:05,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:31:05,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:31:05,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:31:05,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:31:05,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:31:05,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:05,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59070dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05, skipping insertion in model container [2023-11-23 22:31:05,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:05,593 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:31:05,766 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_402405fa-39df-445e-ba56-27f208123ab7/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2023-11-23 22:31:05,831 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_402405fa-39df-445e-ba56-27f208123ab7/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2023-11-23 22:31:05,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:31:05,895 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:31:05,908 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_402405fa-39df-445e-ba56-27f208123ab7/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2023-11-23 22:31:05,939 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_402405fa-39df-445e-ba56-27f208123ab7/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2023-11-23 22:31:05,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:31:05,989 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:31:05,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05 WrapperNode [2023-11-23 22:31:05,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:31:05,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:31:05,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:31:05,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:31:06,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,054 INFO L138 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 454 [2023-11-23 22:31:06,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:31:06,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:31:06,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:31:06,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:31:06,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,074 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,094 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:31:06,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:31:06,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:31:06,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:31:06,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:31:06,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (1/1) ... [2023-11-23 22:31:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:31:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:06,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:31:06,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:31:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-23 22:31:06,221 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-23 22:31:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-11-23 22:31:06,223 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-11-23 22:31:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-23 22:31:06,224 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-23 22:31:06,224 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-23 22:31:06,224 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-23 22:31:06,224 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-11-23 22:31:06,225 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-11-23 22:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-23 22:31:06,225 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-23 22:31:06,225 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-23 22:31:06,225 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-23 22:31:06,226 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-11-23 22:31:06,226 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-11-23 22:31:06,227 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-11-23 22:31:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-11-23 22:31:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-11-23 22:31:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-11-23 22:31:06,228 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-23 22:31:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-23 22:31:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:31:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-23 22:31:06,230 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-23 22:31:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-11-23 22:31:06,231 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-11-23 22:31:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:31:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:31:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-23 22:31:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-23 22:31:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-11-23 22:31:06,233 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-11-23 22:31:06,339 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:31:06,342 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:31:06,969 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2023-11-23 22:31:06,969 INFO L775 $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-23 22:31:07,026 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:31:07,086 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:31:07,086 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-23 22:31:07,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:07 BoogieIcfgContainer [2023-11-23 22:31:07,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:31:07,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:31:07,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:31:07,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:31:07,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:05" (1/3) ... [2023-11-23 22:31:07,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73dfb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:07, skipping insertion in model container [2023-11-23 22:31:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05" (2/3) ... [2023-11-23 22:31:07,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73dfb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:07, skipping insertion in model container [2023-11-23 22:31:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:07" (3/3) ... [2023-11-23 22:31:07,097 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2023-11-23 22:31:07,117 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:31:07,117 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 22:31:07,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:31:07,187 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;@7408bcb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:31:07,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-23 22:31:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 156 states have (on average 1.6346153846153846) internal successors, (255), 164 states have internal predecessors, (255), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-23 22:31:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:31:07,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:07,208 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, 1, 1, 1, 1, 1] [2023-11-23 22:31:07,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:07,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash -454412401, now seen corresponding path program 1 times [2023-11-23 22:31:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445251272] [2023-11-23 22:31:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:07,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:07,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:07,800 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-23 22:31:07,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445251272] [2023-11-23 22:31:07,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445251272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:07,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:07,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:31:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907106363] [2023-11-23 22:31:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:07,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:31:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:31:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:31:07,885 INFO L87 Difference]: Start difference. First operand has 207 states, 156 states have (on average 1.6346153846153846) internal successors, (255), 164 states have internal predecessors, (255), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:09,036 INFO L93 Difference]: Finished difference Result 529 states and 829 transitions. [2023-11-23 22:31:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:31:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-23 22:31:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:09,062 INFO L225 Difference]: With dead ends: 529 [2023-11-23 22:31:09,062 INFO L226 Difference]: Without dead ends: 331 [2023-11-23 22:31:09,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:31:09,076 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 540 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:09,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 580 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 22:31:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-23 22:31:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 290. [2023-11-23 22:31:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5155555555555555) internal successors, (341), 231 states have internal predecessors, (341), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2023-11-23 22:31:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 426 transitions. [2023-11-23 22:31:09,214 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 426 transitions. Word has length 52 [2023-11-23 22:31:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:09,215 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 426 transitions. [2023-11-23 22:31:09,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 426 transitions. [2023-11-23 22:31:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:31:09,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:09,240 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, 1, 1, 1, 1, 1] [2023-11-23 22:31:09,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:31:09,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:09,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash 12588811, now seen corresponding path program 1 times [2023-11-23 22:31:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:09,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569788508] [2023-11-23 22:31:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:09,507 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-23 22:31:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569788508] [2023-11-23 22:31:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569788508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:09,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:31:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730545330] [2023-11-23 22:31:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:09,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:31:09,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:31:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:09,513 INFO L87 Difference]: Start difference. First operand 290 states and 426 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:10,625 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2023-11-23 22:31:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:31:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-23 22:31:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:10,634 INFO L225 Difference]: With dead ends: 619 [2023-11-23 22:31:10,635 INFO L226 Difference]: Without dead ends: 437 [2023-11-23 22:31:10,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-23 22:31:10,642 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 524 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:10,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 909 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 22:31:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-11-23 22:31:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 374. [2023-11-23 22:31:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 299 states have internal predecessors, (440), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2023-11-23 22:31:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 547 transitions. [2023-11-23 22:31:10,724 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 547 transitions. Word has length 52 [2023-11-23 22:31:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:10,724 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 547 transitions. [2023-11-23 22:31:10,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 547 transitions. [2023-11-23 22:31:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:31:10,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:10,731 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, 1, 1, 1, 1, 1] [2023-11-23 22:31:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:31:10,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:10,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash 436235533, now seen corresponding path program 1 times [2023-11-23 22:31:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518081073] [2023-11-23 22:31:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:10,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:10,919 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-23 22:31:10,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518081073] [2023-11-23 22:31:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518081073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:10,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:10,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:31:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765437722] [2023-11-23 22:31:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:10,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:31:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:31:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:10,923 INFO L87 Difference]: Start difference. First operand 374 states and 547 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:12,117 INFO L93 Difference]: Finished difference Result 944 states and 1383 transitions. [2023-11-23 22:31:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 22:31:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-23 22:31:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:12,123 INFO L225 Difference]: With dead ends: 944 [2023-11-23 22:31:12,124 INFO L226 Difference]: Without dead ends: 678 [2023-11-23 22:31:12,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:31:12,126 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 536 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:12,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 900 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 22:31:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-11-23 22:31:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 539. [2023-11-23 22:31:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 425 states have (on average 1.4988235294117647) internal successors, (637), 434 states have internal predecessors, (637), 71 states have call successors, (71), 39 states have call predecessors, (71), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2023-11-23 22:31:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 788 transitions. [2023-11-23 22:31:12,218 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 788 transitions. Word has length 52 [2023-11-23 22:31:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:12,218 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 788 transitions. [2023-11-23 22:31:12,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 788 transitions. [2023-11-23 22:31:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:31:12,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:12,220 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, 1, 1, 1, 1, 1] [2023-11-23 22:31:12,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:31:12,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:12,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -935571765, now seen corresponding path program 1 times [2023-11-23 22:31:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640151286] [2023-11-23 22:31:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:12,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:12,361 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-23 22:31:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:12,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640151286] [2023-11-23 22:31:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640151286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:12,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:31:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990383736] [2023-11-23 22:31:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:12,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:31:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:31:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:31:12,365 INFO L87 Difference]: Start difference. First operand 539 states and 788 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:13,039 INFO L93 Difference]: Finished difference Result 1062 states and 1577 transitions. [2023-11-23 22:31:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 22:31:13,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-23 22:31:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:13,045 INFO L225 Difference]: With dead ends: 1062 [2023-11-23 22:31:13,045 INFO L226 Difference]: Without dead ends: 632 [2023-11-23 22:31:13,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:31:13,048 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 225 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:13,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 687 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:31:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-11-23 22:31:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 549. [2023-11-23 22:31:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 435 states have (on average 1.4873563218390804) internal successors, (647), 444 states have internal predecessors, (647), 71 states have call successors, (71), 39 states have call predecessors, (71), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2023-11-23 22:31:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 798 transitions. [2023-11-23 22:31:13,099 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 798 transitions. Word has length 52 [2023-11-23 22:31:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:13,100 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 798 transitions. [2023-11-23 22:31:13,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 798 transitions. [2023-11-23 22:31:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-23 22:31:13,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:13,102 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, 1, 1, 1, 1, 1] [2023-11-23 22:31:13,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:31:13,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:13,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -233971891, now seen corresponding path program 1 times [2023-11-23 22:31:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:13,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382325540] [2023-11-23 22:31:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:13,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:13,262 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-23 22:31:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382325540] [2023-11-23 22:31:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382325540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:31:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486634441] [2023-11-23 22:31:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:13,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:31:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:31:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:13,265 INFO L87 Difference]: Start difference. First operand 549 states and 798 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:14,728 INFO L93 Difference]: Finished difference Result 2317 states and 3457 transitions. [2023-11-23 22:31:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 22:31:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-11-23 22:31:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:14,743 INFO L225 Difference]: With dead ends: 2317 [2023-11-23 22:31:14,744 INFO L226 Difference]: Without dead ends: 1877 [2023-11-23 22:31:14,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-23 22:31:14,748 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 1036 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:14,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 726 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 22:31:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2023-11-23 22:31:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1637. [2023-11-23 22:31:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1280 states have (on average 1.4234375) internal successors, (1822), 1316 states have internal predecessors, (1822), 212 states have call successors, (212), 129 states have call predecessors, (212), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2023-11-23 22:31:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2339 transitions. [2023-11-23 22:31:14,922 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2339 transitions. Word has length 52 [2023-11-23 22:31:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:14,922 INFO L495 AbstractCegarLoop]: Abstraction has 1637 states and 2339 transitions. [2023-11-23 22:31:14,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 22:31:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2339 transitions. [2023-11-23 22:31:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 22:31:14,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:14,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:14,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:31:14,925 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:14,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1646285467, now seen corresponding path program 1 times [2023-11-23 22:31:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39517945] [2023-11-23 22:31:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:31:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 22:31:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:15,070 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-23 22:31:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39517945] [2023-11-23 22:31:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39517945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:31:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199511424] [2023-11-23 22:31:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:31:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:31:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:31:15,074 INFO L87 Difference]: Start difference. First operand 1637 states and 2339 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:16,086 INFO L93 Difference]: Finished difference Result 1869 states and 2686 transitions. [2023-11-23 22:31:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:31:16,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2023-11-23 22:31:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:16,100 INFO L225 Difference]: With dead ends: 1869 [2023-11-23 22:31:16,100 INFO L226 Difference]: Without dead ends: 1775 [2023-11-23 22:31:16,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:31:16,113 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 712 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:16,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 664 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 22:31:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2023-11-23 22:31:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1738. [2023-11-23 22:31:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1359 states have (on average 1.4260485651214128) internal successors, (1938), 1397 states have internal predecessors, (1938), 225 states have call successors, (225), 136 states have call predecessors, (225), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2023-11-23 22:31:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2486 transitions. [2023-11-23 22:31:16,286 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2486 transitions. Word has length 57 [2023-11-23 22:31:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:16,287 INFO L495 AbstractCegarLoop]: Abstraction has 1738 states and 2486 transitions. [2023-11-23 22:31:16,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2486 transitions. [2023-11-23 22:31:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 22:31:16,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:16,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:16,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:31:16,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:16,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash 704689061, now seen corresponding path program 1 times [2023-11-23 22:31:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727736643] [2023-11-23 22:31:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:31:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 22:31:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:16,484 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-23 22:31:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727736643] [2023-11-23 22:31:16,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727736643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:16,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:31:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081078776] [2023-11-23 22:31:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:16,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:31:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:16,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:31:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:31:16,488 INFO L87 Difference]: Start difference. First operand 1738 states and 2486 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:17,802 INFO L93 Difference]: Finished difference Result 2099 states and 3016 transitions. [2023-11-23 22:31:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 22:31:17,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2023-11-23 22:31:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:17,815 INFO L225 Difference]: With dead ends: 2099 [2023-11-23 22:31:17,816 INFO L226 Difference]: Without dead ends: 1911 [2023-11-23 22:31:17,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-11-23 22:31:17,818 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 689 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:17,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 941 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 22:31:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2023-11-23 22:31:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1839. [2023-11-23 22:31:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1438 states have (on average 1.4276773296244785) internal successors, (2053), 1478 states have internal predecessors, (2053), 238 states have call successors, (238), 143 states have call predecessors, (238), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2023-11-23 22:31:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2635 transitions. [2023-11-23 22:31:18,005 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2635 transitions. Word has length 57 [2023-11-23 22:31:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:18,006 INFO L495 AbstractCegarLoop]: Abstraction has 1839 states and 2635 transitions. [2023-11-23 22:31:18,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2635 transitions. [2023-11-23 22:31:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 22:31:18,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:18,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:18,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:31:18,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:18,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1598175399, now seen corresponding path program 1 times [2023-11-23 22:31:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:18,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902089288] [2023-11-23 22:31:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:18,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:31:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 22:31:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:18,103 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-23 22:31:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902089288] [2023-11-23 22:31:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902089288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:31:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402861843] [2023-11-23 22:31:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:18,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:31:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:31:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:18,106 INFO L87 Difference]: Start difference. First operand 1839 states and 2635 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 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-23 22:31:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:19,169 INFO L93 Difference]: Finished difference Result 2445 states and 3511 transitions. [2023-11-23 22:31:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:31:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 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 57 [2023-11-23 22:31:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:19,187 INFO L225 Difference]: With dead ends: 2445 [2023-11-23 22:31:19,187 INFO L226 Difference]: Without dead ends: 2162 [2023-11-23 22:31:19,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-23 22:31:19,190 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 654 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:19,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 815 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 22:31:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2023-11-23 22:31:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2091. [2023-11-23 22:31:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 1635 states have (on average 1.4256880733944954) internal successors, (2331), 1679 states have internal predecessors, (2331), 268 states have call successors, (268), 164 states have call predecessors, (268), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2023-11-23 22:31:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2981 transitions. [2023-11-23 22:31:19,443 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2981 transitions. Word has length 57 [2023-11-23 22:31:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:19,443 INFO L495 AbstractCegarLoop]: Abstraction has 2091 states and 2981 transitions. [2023-11-23 22:31:19,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 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-23 22:31:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2981 transitions. [2023-11-23 22:31:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-23 22:31:19,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:19,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:19,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:31:19,447 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:19,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 913941864, now seen corresponding path program 1 times [2023-11-23 22:31:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:19,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356184223] [2023-11-23 22:31:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:31:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 22:31:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:19,595 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-23 22:31:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356184223] [2023-11-23 22:31:19,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356184223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:19,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:19,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:31:19,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780785665] [2023-11-23 22:31:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:19,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:31:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:31:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:31:19,599 INFO L87 Difference]: Start difference. First operand 2091 states and 2981 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:31:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:20,694 INFO L93 Difference]: Finished difference Result 2699 states and 3851 transitions. [2023-11-23 22:31:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 22:31:20,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-11-23 22:31:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:20,711 INFO L225 Difference]: With dead ends: 2699 [2023-11-23 22:31:20,711 INFO L226 Difference]: Without dead ends: 2164 [2023-11-23 22:31:20,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-23 22:31:20,715 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 318 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:20,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 992 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 22:31:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2023-11-23 22:31:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2103. [2023-11-23 22:31:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1644 states have (on average 1.4215328467153285) internal successors, (2337), 1688 states have internal predecessors, (2337), 268 states have call successors, (268), 164 states have call predecessors, (268), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2023-11-23 22:31:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2990 transitions. [2023-11-23 22:31:20,937 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2990 transitions. Word has length 58 [2023-11-23 22:31:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:20,938 INFO L495 AbstractCegarLoop]: Abstraction has 2103 states and 2990 transitions. [2023-11-23 22:31:20,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:31:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2990 transitions. [2023-11-23 22:31:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-23 22:31:20,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:20,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:20,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:31:20,941 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:20,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash 841555306, now seen corresponding path program 1 times [2023-11-23 22:31:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633022239] [2023-11-23 22:31:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 22:31:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:21,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 22:31:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:21,108 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-23 22:31:21,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:21,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633022239] [2023-11-23 22:31:21,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633022239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:21,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:21,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:31:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112436874] [2023-11-23 22:31:21,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:21,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:31:21,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:21,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:31:21,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:31:21,111 INFO L87 Difference]: Start difference. First operand 2103 states and 2990 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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-23 22:31:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:23,168 INFO L93 Difference]: Finished difference Result 4102 states and 5905 transitions. [2023-11-23 22:31:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-23 22:31:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2023-11-23 22:31:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:23,185 INFO L225 Difference]: With dead ends: 4102 [2023-11-23 22:31:23,186 INFO L226 Difference]: Without dead ends: 2436 [2023-11-23 22:31:23,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-23 22:31:23,193 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 1252 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:23,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1334 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-23 22:31:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2023-11-23 22:31:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2306. [2023-11-23 22:31:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 1791 states have (on average 1.4048017867113345) internal successors, (2516), 1839 states have internal predecessors, (2516), 298 states have call successors, (298), 185 states have call predecessors, (298), 215 states have return successors, (434), 288 states have call predecessors, (434), 294 states have call successors, (434) [2023-11-23 22:31:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3248 transitions. [2023-11-23 22:31:23,453 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3248 transitions. Word has length 58 [2023-11-23 22:31:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:23,453 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 3248 transitions. [2023-11-23 22:31:23,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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-23 22:31:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3248 transitions. [2023-11-23 22:31:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 22:31:23,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:23,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:23,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:31:23,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:23,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1306304913, now seen corresponding path program 1 times [2023-11-23 22:31:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603843238] [2023-11-23 22:31:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 22:31:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 22:31:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:23,576 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-23 22:31:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603843238] [2023-11-23 22:31:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603843238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:31:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120711000] [2023-11-23 22:31:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:31:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:31:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:31:23,579 INFO L87 Difference]: Start difference. First operand 2306 states and 3248 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:31:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:24,631 INFO L93 Difference]: Finished difference Result 3189 states and 4487 transitions. [2023-11-23 22:31:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:31:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-11-23 22:31:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:24,649 INFO L225 Difference]: With dead ends: 3189 [2023-11-23 22:31:24,649 INFO L226 Difference]: Without dead ends: 2439 [2023-11-23 22:31:24,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:31:24,654 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 212 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:24,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1073 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 22:31:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2023-11-23 22:31:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2342. [2023-11-23 22:31:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 1818 states have (on average 1.3987898789878987) internal successors, (2543), 1866 states have internal predecessors, (2543), 298 states have call successors, (298), 185 states have call predecessors, (298), 224 states have return successors, (443), 297 states have call predecessors, (443), 294 states have call successors, (443) [2023-11-23 22:31:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 3284 transitions. [2023-11-23 22:31:24,920 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 3284 transitions. Word has length 59 [2023-11-23 22:31:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:24,921 INFO L495 AbstractCegarLoop]: Abstraction has 2342 states and 3284 transitions. [2023-11-23 22:31:24,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 22:31:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 3284 transitions. [2023-11-23 22:31:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 22:31:24,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:24,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:24,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:31:24,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:24,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1165756303, now seen corresponding path program 1 times [2023-11-23 22:31:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880372183] [2023-11-23 22:31:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 22:31:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 22:31:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:25,122 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-23 22:31:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880372183] [2023-11-23 22:31:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880372183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:25,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:25,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 22:31:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452220293] [2023-11-23 22:31:25,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:25,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:31:25,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:31:25,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:31:25,125 INFO L87 Difference]: Start difference. First operand 2342 states and 3284 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:26,253 INFO L93 Difference]: Finished difference Result 3236 states and 4501 transitions. [2023-11-23 22:31:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 22:31:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-11-23 22:31:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:26,274 INFO L225 Difference]: With dead ends: 3236 [2023-11-23 22:31:26,274 INFO L226 Difference]: Without dead ends: 2530 [2023-11-23 22:31:26,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-11-23 22:31:26,278 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 709 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:26,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 663 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 22:31:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2023-11-23 22:31:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2349. [2023-11-23 22:31:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 1825 states have (on average 1.3961643835616437) internal successors, (2548), 1871 states have internal predecessors, (2548), 299 states have call successors, (299), 186 states have call predecessors, (299), 223 states have return successors, (439), 298 states have call predecessors, (439), 295 states have call successors, (439) [2023-11-23 22:31:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3286 transitions. [2023-11-23 22:31:26,548 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3286 transitions. Word has length 59 [2023-11-23 22:31:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:26,548 INFO L495 AbstractCegarLoop]: Abstraction has 2349 states and 3286 transitions. [2023-11-23 22:31:26,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3286 transitions. [2023-11-23 22:31:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-23 22:31:26,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:26,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:26,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:31:26,551 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:26,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1983404753, now seen corresponding path program 1 times [2023-11-23 22:31:26,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:26,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034319646] [2023-11-23 22:31:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 22:31:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 22:31:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:26,661 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-23 22:31:26,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034319646] [2023-11-23 22:31:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034319646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:26,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:26,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:31:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947457094] [2023-11-23 22:31:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:26,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:31:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:31:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:26,664 INFO L87 Difference]: Start difference. First operand 2349 states and 3286 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:27,576 INFO L93 Difference]: Finished difference Result 4071 states and 5645 transitions. [2023-11-23 22:31:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:31:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-11-23 22:31:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:27,598 INFO L225 Difference]: With dead ends: 4071 [2023-11-23 22:31:27,598 INFO L226 Difference]: Without dead ends: 3281 [2023-11-23 22:31:27,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-23 22:31:27,602 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 673 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:27,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 525 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:31:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2023-11-23 22:31:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3123. [2023-11-23 22:31:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2404 states have (on average 1.3735440931780365) internal successors, (3302), 2463 states have internal predecessors, (3302), 403 states have call successors, (403), 250 states have call predecessors, (403), 314 states have return successors, (629), 419 states have call predecessors, (629), 399 states have call successors, (629) [2023-11-23 22:31:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4334 transitions. [2023-11-23 22:31:27,983 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4334 transitions. Word has length 59 [2023-11-23 22:31:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:27,984 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4334 transitions. [2023-11-23 22:31:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:31:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4334 transitions. [2023-11-23 22:31:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-23 22:31:27,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:27,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:27,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 22:31:27,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:27,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1186634789, now seen corresponding path program 1 times [2023-11-23 22:31:27,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:27,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239710646] [2023-11-23 22:31:27,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:27,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 22:31:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:31:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-23 22:31:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 22:31:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 22:31:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:28,066 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-23 22:31:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239710646] [2023-11-23 22:31:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239710646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:28,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:28,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:31:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423571898] [2023-11-23 22:31:28,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:28,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:31:28,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:28,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:31:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:31:28,069 INFO L87 Difference]: Start difference. First operand 3123 states and 4334 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-23 22:31:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:28,846 INFO L93 Difference]: Finished difference Result 4705 states and 6549 transitions. [2023-11-23 22:31:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:31:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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 60 [2023-11-23 22:31:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:28,857 INFO L225 Difference]: With dead ends: 4705 [2023-11-23 22:31:28,857 INFO L226 Difference]: Without dead ends: 1537 [2023-11-23 22:31:28,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:31:28,865 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 424 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:28,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 479 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 22:31:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2023-11-23 22:31:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1537. [2023-11-23 22:31:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1204 states have (on average 1.4169435215946844) internal successors, (1706), 1237 states have internal predecessors, (1706), 196 states have call successors, (196), 121 states have call predecessors, (196), 136 states have return successors, (291), 182 states have call predecessors, (291), 194 states have call successors, (291) [2023-11-23 22:31:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2193 transitions. [2023-11-23 22:31:29,035 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2193 transitions. Word has length 60 [2023-11-23 22:31:29,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:29,036 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2193 transitions. [2023-11-23 22:31:29,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-23 22:31:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2193 transitions. [2023-11-23 22:31:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 22:31:29,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:29,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:29,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 22:31:29,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:29,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1896845261, now seen corresponding path program 1 times [2023-11-23 22:31:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472564297] [2023-11-23 22:31:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 22:31:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 22:31:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 22:31:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472564297] [2023-11-23 22:31:29,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472564297] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452074522] [2023-11-23 22:31:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:29,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:29,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:31:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:29,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:31:29,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 22:31:29,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452074522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 22:31:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716458880] [2023-11-23 22:31:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:29,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:29,400 INFO L87 Difference]: Start difference. First operand 1537 states and 2193 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 22:31:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:29,694 INFO L93 Difference]: Finished difference Result 4401 states and 6309 transitions. [2023-11-23 22:31:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2023-11-23 22:31:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:29,718 INFO L225 Difference]: With dead ends: 4401 [2023-11-23 22:31:29,720 INFO L226 Difference]: Without dead ends: 1901 [2023-11-23 22:31:29,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:29,729 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 107 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:29,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 362 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:31:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2023-11-23 22:31:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1901. [2023-11-23 22:31:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1494 states have (on average 1.4089692101740294) internal successors, (2105), 1531 states have internal predecessors, (2105), 238 states have call successors, (238), 149 states have call predecessors, (238), 168 states have return successors, (355), 224 states have call predecessors, (355), 236 states have call successors, (355) [2023-11-23 22:31:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2698 transitions. [2023-11-23 22:31:29,907 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2698 transitions. Word has length 84 [2023-11-23 22:31:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:29,909 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 2698 transitions. [2023-11-23 22:31:29,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 22:31:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2698 transitions. [2023-11-23 22:31:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 22:31:29,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:29,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:29,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:30,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 22:31:30,129 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:30,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1470810152, now seen corresponding path program 1 times [2023-11-23 22:31:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:30,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062054958] [2023-11-23 22:31:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 22:31:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-23 22:31:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-23 22:31:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 22:31:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:30,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062054958] [2023-11-23 22:31:30,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062054958] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859747421] [2023-11-23 22:31:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:30,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:30,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:31:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:30,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:31:30,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 22:31:30,573 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859747421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:30,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-23 22:31:30,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071034818] [2023-11-23 22:31:30,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:30,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:30,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:30,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:30,575 INFO L87 Difference]: Start difference. First operand 1901 states and 2698 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 22:31:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:30,928 INFO L93 Difference]: Finished difference Result 4559 states and 6545 transitions. [2023-11-23 22:31:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2023-11-23 22:31:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:30,943 INFO L225 Difference]: With dead ends: 4559 [2023-11-23 22:31:30,943 INFO L226 Difference]: Without dead ends: 3027 [2023-11-23 22:31:30,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:30,948 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 78 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:30,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 271 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2023-11-23 22:31:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2998. [2023-11-23 22:31:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2366 states have (on average 1.4061707523245985) internal successors, (3327), 2420 states have internal predecessors, (3327), 366 states have call successors, (366), 234 states have call predecessors, (366), 265 states have return successors, (535), 347 states have call predecessors, (535), 364 states have call successors, (535) [2023-11-23 22:31:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4228 transitions. [2023-11-23 22:31:31,270 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4228 transitions. Word has length 107 [2023-11-23 22:31:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:31,271 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 4228 transitions. [2023-11-23 22:31:31,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 22:31:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4228 transitions. [2023-11-23 22:31:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-23 22:31:31,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:31,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:31,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:31,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 22:31:31,504 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:31,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1879298055, now seen corresponding path program 1 times [2023-11-23 22:31:31,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435479002] [2023-11-23 22:31:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:31:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 22:31:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:31:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:31:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-23 22:31:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435479002] [2023-11-23 22:31:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435479002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691725306] [2023-11-23 22:31:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:31,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:31,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:31,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:31:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:31,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:31:31,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 22:31:31,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691725306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 22:31:31,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53807489] [2023-11-23 22:31:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:31,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:31,810 INFO L87 Difference]: Start difference. First operand 2998 states and 4228 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 22:31:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:32,098 INFO L93 Difference]: Finished difference Result 6412 states and 9134 transitions. [2023-11-23 22:31:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 122 [2023-11-23 22:31:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:32,115 INFO L225 Difference]: With dead ends: 6412 [2023-11-23 22:31:32,115 INFO L226 Difference]: Without dead ends: 3422 [2023-11-23 22:31:32,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:32,125 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:32,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 154 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2023-11-23 22:31:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3327. [2023-11-23 22:31:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 2670 states have (on average 1.3325842696629213) internal successors, (3558), 2719 states have internal predecessors, (3558), 362 states have call successors, (362), 260 states have call predecessors, (362), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2023-11-23 22:31:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 4437 transitions. [2023-11-23 22:31:32,464 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 4437 transitions. Word has length 122 [2023-11-23 22:31:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:32,464 INFO L495 AbstractCegarLoop]: Abstraction has 3327 states and 4437 transitions. [2023-11-23 22:31:32,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 22:31:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 4437 transitions. [2023-11-23 22:31:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-23 22:31:32,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:32,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:32,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:32,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 22:31:32,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:32,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -563953142, now seen corresponding path program 1 times [2023-11-23 22:31:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:32,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548481199] [2023-11-23 22:31:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 22:31:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 22:31:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 22:31:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-23 22:31:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-23 22:31:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548481199] [2023-11-23 22:31:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548481199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593890856] [2023-11-23 22:31:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:32,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:32,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:32,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:32,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:31:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:32,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:31:32,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 22:31:32,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:32,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593890856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:32,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 22:31:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290669018] [2023-11-23 22:31:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:32,974 INFO L87 Difference]: Start difference. First operand 3327 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 22:31:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:33,316 INFO L93 Difference]: Finished difference Result 6719 states and 9011 transitions. [2023-11-23 22:31:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:33,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 122 [2023-11-23 22:31:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:33,330 INFO L225 Difference]: With dead ends: 6719 [2023-11-23 22:31:33,330 INFO L226 Difference]: Without dead ends: 3402 [2023-11-23 22:31:33,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:33,339 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 112 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:33,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 256 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2023-11-23 22:31:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3297. [2023-11-23 22:31:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2640 states have (on average 1.3022727272727272) internal successors, (3438), 2689 states have internal predecessors, (3438), 362 states have call successors, (362), 260 states have call predecessors, (362), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2023-11-23 22:31:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 4317 transitions. [2023-11-23 22:31:33,668 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 4317 transitions. Word has length 122 [2023-11-23 22:31:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:33,668 INFO L495 AbstractCegarLoop]: Abstraction has 3297 states and 4317 transitions. [2023-11-23 22:31:33,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 22:31:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 4317 transitions. [2023-11-23 22:31:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-23 22:31:33,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:33,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:33,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:33,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 22:31:33,897 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:33,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash 965694263, now seen corresponding path program 1 times [2023-11-23 22:31:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456244115] [2023-11-23 22:31:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 22:31:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 22:31:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-23 22:31:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-23 22:31:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 22:31:34,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456244115] [2023-11-23 22:31:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456244115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133531679] [2023-11-23 22:31:34,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:34,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:34,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:34,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:34,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 22:31:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:34,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:31:34,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 22:31:34,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133531679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 22:31:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769451223] [2023-11-23 22:31:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:34,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:34,252 INFO L87 Difference]: Start difference. First operand 3297 states and 4317 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 22:31:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:34,944 INFO L93 Difference]: Finished difference Result 9669 states and 12795 transitions. [2023-11-23 22:31:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:34,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-23 22:31:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:34,969 INFO L225 Difference]: With dead ends: 9669 [2023-11-23 22:31:34,969 INFO L226 Difference]: Without dead ends: 6382 [2023-11-23 22:31:34,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:34,981 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 117 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:34,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 357 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2023-11-23 22:31:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 6378. [2023-11-23 22:31:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6378 states, 5098 states have (on average 1.2863868183601412) internal successors, (6558), 5195 states have internal predecessors, (6558), 703 states have call successors, (703), 510 states have call predecessors, (703), 576 states have return successors, (1152), 680 states have call predecessors, (1152), 701 states have call successors, (1152) [2023-11-23 22:31:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6378 states to 6378 states and 8413 transitions. [2023-11-23 22:31:35,505 INFO L78 Accepts]: Start accepts. Automaton has 6378 states and 8413 transitions. Word has length 123 [2023-11-23 22:31:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:35,506 INFO L495 AbstractCegarLoop]: Abstraction has 6378 states and 8413 transitions. [2023-11-23 22:31:35,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-23 22:31:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6378 states and 8413 transitions. [2023-11-23 22:31:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-23 22:31:35,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:35,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:35,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 22:31:35,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:35,733 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:35,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash -614170303, now seen corresponding path program 1 times [2023-11-23 22:31:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467913970] [2023-11-23 22:31:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 22:31:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:31:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 22:31:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-23 22:31:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 22:31:35,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467913970] [2023-11-23 22:31:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467913970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757341286] [2023-11-23 22:31:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:35,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:35,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:35,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 22:31:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:36,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:31:36,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:31:36,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:36,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757341286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:36,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 22:31:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571721385] [2023-11-23 22:31:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:36,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:36,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:36,124 INFO L87 Difference]: Start difference. First operand 6378 states and 8413 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-23 22:31:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:36,689 INFO L93 Difference]: Finished difference Result 8989 states and 12108 transitions. [2023-11-23 22:31:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 124 [2023-11-23 22:31:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:36,709 INFO L225 Difference]: With dead ends: 8989 [2023-11-23 22:31:36,709 INFO L226 Difference]: Without dead ends: 5827 [2023-11-23 22:31:36,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:36,720 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 84 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:36,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 320 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5827 states. [2023-11-23 22:31:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5827 to 5752. [2023-11-23 22:31:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5752 states, 4605 states have (on average 1.2718783930510316) internal successors, (5857), 4694 states have internal predecessors, (5857), 631 states have call successors, (631), 460 states have call predecessors, (631), 515 states have return successors, (1012), 605 states have call predecessors, (1012), 629 states have call successors, (1012) [2023-11-23 22:31:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 7500 transitions. [2023-11-23 22:31:37,365 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 7500 transitions. Word has length 124 [2023-11-23 22:31:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:37,365 INFO L495 AbstractCegarLoop]: Abstraction has 5752 states and 7500 transitions. [2023-11-23 22:31:37,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-23 22:31:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 7500 transitions. [2023-11-23 22:31:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 22:31:37,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:37,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:37,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:37,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:37,603 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:37,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1179770301, now seen corresponding path program 1 times [2023-11-23 22:31:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034365353] [2023-11-23 22:31:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:37,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 22:31:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:31:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 22:31:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 22:31:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 22:31:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034365353] [2023-11-23 22:31:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034365353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019843188] [2023-11-23 22:31:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:37,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:37,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 22:31:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:37,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:31:37,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 22:31:37,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019843188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:37,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-23 22:31:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593765886] [2023-11-23 22:31:37,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:37,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:31:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:37,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:31:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:31:37,985 INFO L87 Difference]: Start difference. First operand 5752 states and 7500 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 22:31:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:38,542 INFO L93 Difference]: Finished difference Result 8170 states and 10762 transitions. [2023-11-23 22:31:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:31:38,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-11-23 22:31:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:38,558 INFO L225 Difference]: With dead ends: 8170 [2023-11-23 22:31:38,558 INFO L226 Difference]: Without dead ends: 4601 [2023-11-23 22:31:38,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:31:38,569 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 141 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:38,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 214 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:31:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2023-11-23 22:31:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4559. [2023-11-23 22:31:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4559 states, 3648 states have (on average 1.2354714912280702) internal successors, (4507), 3703 states have internal predecessors, (4507), 513 states have call successors, (513), 370 states have call predecessors, (513), 397 states have return successors, (751), 489 states have call predecessors, (751), 511 states have call successors, (751) [2023-11-23 22:31:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 4559 states and 5771 transitions. [2023-11-23 22:31:39,070 INFO L78 Accepts]: Start accepts. Automaton has 4559 states and 5771 transitions. Word has length 125 [2023-11-23 22:31:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:39,070 INFO L495 AbstractCegarLoop]: Abstraction has 4559 states and 5771 transitions. [2023-11-23 22:31:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 22:31:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4559 states and 5771 transitions. [2023-11-23 22:31:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 22:31:39,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:39,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:39,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:39,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-23 22:31:39,293 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:39,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1496222081, now seen corresponding path program 1 times [2023-11-23 22:31:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:39,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4104888] [2023-11-23 22:31:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:39,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 22:31:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:31:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 22:31:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 22:31:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 22:31:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4104888] [2023-11-23 22:31:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4104888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384841857] [2023-11-23 22:31:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:39,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:39,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:39,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 22:31:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:39,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:31:39,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 22:31:39,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384841857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-23 22:31:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040087674] [2023-11-23 22:31:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:39,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:31:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:31:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:31:39,675 INFO L87 Difference]: Start difference. First operand 4559 states and 5771 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 22:31:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:40,281 INFO L93 Difference]: Finished difference Result 7254 states and 9241 transitions. [2023-11-23 22:31:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:31:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-11-23 22:31:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:40,292 INFO L225 Difference]: With dead ends: 7254 [2023-11-23 22:31:40,292 INFO L226 Difference]: Without dead ends: 2857 [2023-11-23 22:31:40,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-23 22:31:40,306 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 168 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:40,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 208 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 22:31:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2023-11-23 22:31:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2027. [2023-11-23 22:31:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1625 states have (on average 1.164923076923077) internal successors, (1893), 1646 states have internal predecessors, (1893), 227 states have call successors, (227), 161 states have call predecessors, (227), 174 states have return successors, (300), 221 states have call predecessors, (300), 225 states have call successors, (300) [2023-11-23 22:31:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2420 transitions. [2023-11-23 22:31:40,643 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2420 transitions. Word has length 125 [2023-11-23 22:31:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:40,643 INFO L495 AbstractCegarLoop]: Abstraction has 2027 states and 2420 transitions. [2023-11-23 22:31:40,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 22:31:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2420 transitions. [2023-11-23 22:31:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-23 22:31:40,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:40,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:40,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:40,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-23 22:31:40,861 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:40,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash 612713091, now seen corresponding path program 1 times [2023-11-23 22:31:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:40,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702399530] [2023-11-23 22:31:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 22:31:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:31:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 22:31:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 22:31:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 22:31:41,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702399530] [2023-11-23 22:31:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702399530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058651661] [2023-11-23 22:31:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:41,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:41,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 22:31:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:41,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 22:31:41,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:31:41,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:31:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-23 22:31:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058651661] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:41,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:31:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2023-11-23 22:31:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800371004] [2023-11-23 22:31:41,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:31:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:31:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:31:41,330 INFO L87 Difference]: Start difference. First operand 2027 states and 2420 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 22:31:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:41,759 INFO L93 Difference]: Finished difference Result 3502 states and 4147 transitions. [2023-11-23 22:31:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:31:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 125 [2023-11-23 22:31:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:41,769 INFO L225 Difference]: With dead ends: 3502 [2023-11-23 22:31:41,769 INFO L226 Difference]: Without dead ends: 3499 [2023-11-23 22:31:41,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 271 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-23 22:31:41,772 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 205 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:41,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 380 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:31:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2023-11-23 22:31:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3197. [2023-11-23 22:31:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3197 states, 2567 states have (on average 1.1589403973509933) internal successors, (2975), 2598 states have internal predecessors, (2975), 355 states have call successors, (355), 249 states have call predecessors, (355), 274 states have return successors, (461), 351 states have call predecessors, (461), 353 states have call successors, (461) [2023-11-23 22:31:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 3791 transitions. [2023-11-23 22:31:42,146 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 3791 transitions. Word has length 125 [2023-11-23 22:31:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:42,147 INFO L495 AbstractCegarLoop]: Abstraction has 3197 states and 3791 transitions. [2023-11-23 22:31:42,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 22:31:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 3791 transitions. [2023-11-23 22:31:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-23 22:31:42,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:42,151 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:42,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:42,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:42,371 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:42,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1670746517, now seen corresponding path program 1 times [2023-11-23 22:31:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:42,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522166246] [2023-11-23 22:31:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 22:31:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:31:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 22:31:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 22:31:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 22:31:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522166246] [2023-11-23 22:31:42,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522166246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:42,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480085955] [2023-11-23 22:31:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:42,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:42,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:42,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:42,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 22:31:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:42,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:31:42,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-23 22:31:42,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480085955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 22:31:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705016524] [2023-11-23 22:31:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:42,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:42,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:42,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:42,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:42,660 INFO L87 Difference]: Start difference. First operand 3197 states and 3791 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 22:31:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:42,952 INFO L93 Difference]: Finished difference Result 5219 states and 6226 transitions. [2023-11-23 22:31:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 129 [2023-11-23 22:31:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:42,963 INFO L225 Difference]: With dead ends: 5219 [2023-11-23 22:31:42,964 INFO L226 Difference]: Without dead ends: 3217 [2023-11-23 22:31:42,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:31:42,970 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:42,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 246 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2023-11-23 22:31:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3201. [2023-11-23 22:31:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 2571 states have (on average 1.1586931155192532) internal successors, (2979), 2602 states have internal predecessors, (2979), 355 states have call successors, (355), 249 states have call predecessors, (355), 274 states have return successors, (461), 351 states have call predecessors, (461), 353 states have call successors, (461) [2023-11-23 22:31:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 3795 transitions. [2023-11-23 22:31:43,389 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 3795 transitions. Word has length 129 [2023-11-23 22:31:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:43,389 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 3795 transitions. [2023-11-23 22:31:43,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 22:31:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 3795 transitions. [2023-11-23 22:31:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-23 22:31:43,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:43,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:43,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:43,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:43,617 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:43,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 975573921, now seen corresponding path program 1 times [2023-11-23 22:31:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843401672] [2023-11-23 22:31:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:31:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 22:31:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 22:31:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:31:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 22:31:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 22:31:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 22:31:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-23 22:31:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-23 22:31:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 22:31:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-23 22:31:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843401672] [2023-11-23 22:31:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843401672] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:31:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016019693] [2023-11-23 22:31:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:43,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:31:43,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:31:43,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:31:43,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 22:31:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:43,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 22:31:43,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:31:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-23 22:31:43,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:31:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016019693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:31:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-23 22:31:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003965300] [2023-11-23 22:31:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:43,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:31:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:43,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:31:43,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:31:43,910 INFO L87 Difference]: Start difference. First operand 3201 states and 3795 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 22:31:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:31:44,122 INFO L93 Difference]: Finished difference Result 4641 states and 5523 transitions. [2023-11-23 22:31:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:31:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2023-11-23 22:31:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:31:44,125 INFO L225 Difference]: With dead ends: 4641 [2023-11-23 22:31:44,125 INFO L226 Difference]: Without dead ends: 940 [2023-11-23 22:31:44,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 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-23 22:31:44,133 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:31:44,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 367 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:31:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-23 22:31:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2023-11-23 22:31:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 752 states have (on average 1.125) internal successors, (846), 761 states have internal predecessors, (846), 108 states have call successors, (108), 75 states have call predecessors, (108), 79 states have return successors, (119), 104 states have call predecessors, (119), 107 states have call successors, (119) [2023-11-23 22:31:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1073 transitions. [2023-11-23 22:31:44,230 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1073 transitions. Word has length 130 [2023-11-23 22:31:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:31:44,231 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1073 transitions. [2023-11-23 22:31:44,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 22:31:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1073 transitions. [2023-11-23 22:31:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-23 22:31:44,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:31:44,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:31:44,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 22:31:44,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-23 22:31:44,452 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:31:44,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash -543895967, now seen corresponding path program 1 times [2023-11-23 22:31:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:44,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74220116] [2023-11-23 22:31:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:31:44,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:31:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:31:44,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:31:44,545 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:31:44,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-23 22:31:44,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-23 22:31:44,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-23 22:31:44,552 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-23 22:31:44,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:31:44,671 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-23 22:31:44,685 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-23 22:31:44,693 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-23 22:31:44,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:31:44 BoogieIcfgContainer [2023-11-23 22:31:44,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:31:44,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:31:44,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:31:44,735 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:31:44,736 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:07" (3/4) ... [2023-11-23 22:31:44,737 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 22:31:44,782 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-23 22:31:44,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-23 22:31:44,790 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-23 22:31:44,910 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 22:31:44,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:31:44,911 INFO L158 Benchmark]: Toolchain (without parser) took 39407.65ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 95.4MB in the beginning and 1.0GB in the end (delta: -926.2MB). Peak memory consumption was 367.4MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,911 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 100.7MB. Free memory was 69.2MB in the beginning and 69.2MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:31:44,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.62ms. Allocated memory is still 132.1MB. Free memory was 94.9MB in the beginning and 77.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.05ms. Allocated memory is still 132.1MB. Free memory was 77.5MB in the beginning and 74.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,913 INFO L158 Benchmark]: Boogie Preprocessor took 72.44ms. Allocated memory is still 132.1MB. Free memory was 74.4MB in the beginning and 71.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,913 INFO L158 Benchmark]: RCFGBuilder took 959.04ms. Allocated memory is still 132.1MB. Free memory was 71.2MB in the beginning and 91.6MB in the end (delta: -20.4MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,916 INFO L158 Benchmark]: TraceAbstraction took 37644.82ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 90.8MB in the beginning and 1.0GB in the end (delta: -947.8MB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,916 INFO L158 Benchmark]: Witness Printer took 175.75ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-23 22:31:44,926 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.30ms. Allocated memory is still 100.7MB. Free memory was 69.2MB in the beginning and 69.2MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.62ms. Allocated memory is still 132.1MB. Free memory was 94.9MB in the beginning and 77.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.05ms. Allocated memory is still 132.1MB. Free memory was 77.5MB in the beginning and 74.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.44ms. Allocated memory is still 132.1MB. Free memory was 74.4MB in the beginning and 71.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 959.04ms. Allocated memory is still 132.1MB. Free memory was 71.2MB in the beginning and 91.6MB in the end (delta: -20.4MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37644.82ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 90.8MB in the beginning and 1.0GB in the end (delta: -947.8MB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. * Witness Printer took 175.75ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1012] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L850] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L855] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L860] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L865] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1014] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1015] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L725] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L727] return (__retres1); [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L744] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L746] return (__retres1); [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, tmp=0, tmp___0=0, token=0] [L1015] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1016] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L878] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L883] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L888] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L893] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1016] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L1019] COND TRUE 1 [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L801] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L776] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L792] return (__retres1); [L804] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, tmp=1, tmp_ndt_1=0, token=0] [L811-L822] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=0, t=0, tmp=1, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE, EXPR \read(tmp_ndt_2) [L830] EXPR t1_st = 1 [L831] CALL, EXPR transmit1() [L679] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=0, t1_st=1, t=0, token=0] [L690] COND TRUE 1 [L692] t1_pc = 1 [L693] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L831] RET, EXPR transmit1() [L825-L836] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=0] [L801] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L776] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L792] return (__retres1); [L804] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE, EXPR \read(tmp_ndt_1) [L816] EXPR m_st = 1 [L817] CALL, EXPR master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=0, token=0] [L634] COND TRUE 1 [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L932] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L725] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L727] return (__retres1); [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L734] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=0] [L746] return (__retres1); [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, tmp=0, tmp___0=1, token=0] [L932] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, token=0] [L640] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, tmp_var=0, token=0] [L817] RET, EXPR master() [L811-L822] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=0, t=0, tmp=1, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE, EXPR \read(tmp_ndt_2) [L830] EXPR t1_st = 1 [L831] CALL, EXPR transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=0] [L682] COND TRUE t1_pc == 1 [L698] token += 1 [L699] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L700] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L932] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L715] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L727] return (__retres1); [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, tmp=1, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L734] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L735] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L744] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L746] return (__retres1); [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, tmp=1, tmp___0=0, token=1] [L932] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L700] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L701] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=1, t=0, token=1] [L690] COND TRUE 1 [L692] t1_pc = 1 [L693] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L831] RET, EXPR transmit1() [L825-L836] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=1] [L801] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=1] [L804] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L776] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L792] return (__retres1); [L804] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=1] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp=1, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L626] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L653] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L659] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L660] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, tmp_var=5, token=1] [L662] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] [L599] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, fast_clk_edge=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t1_i=1, t1_pc=1, t1_st=2, t=0, token=1] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 207 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 37.4s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9895 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9644 mSDsluCounter, 14423 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9897 mSDsCounter, 2143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12513 IncrementalHoareTripleChecker+Invalid, 14656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2143 mSolverCounterUnsat, 4526 mSDtfsCounter, 12513 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2198 GetRequests, 1929 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6378occurred in iteration=19, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2871 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3546 NumberOfCodeBlocks, 3546 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3504 ConstructedInterpolants, 0 QuantifiedInterpolants, 5832 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4690 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 37 InterpolantComputations, 25 PerfectInterpolantSequences, 1424/1522 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-23 22:31:44,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402405fa-39df-445e-ba56-27f208123ab7/bin/uautomizer-verify-zZY32mL2XJ/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE