./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu --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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:31,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:31,335 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:47:31,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:31,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:31,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:31,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:31,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:31,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:31,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:31,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:31,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:31,386 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:31,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:31,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:31,388 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:47:31,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:31,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:47:31,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:31,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:31,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:31,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:31,392 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:47:31,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:31,393 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:31,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:31,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:31,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:31,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:31,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:31,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:31,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:31,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:31,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:31,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:31,397 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:31,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:31,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:31,398 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:31,398 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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu 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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2023-11-19 07:47:31,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:31,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:31,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:31,728 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:31,729 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:31,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-11-19 07:47:34,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:35,218 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:35,219 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-11-19 07:47:35,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/data/bb0469f0a/f6f0bb91f9344ebe8c1c56f3123694f9/FLAGb24a79505 [2023-11-19 07:47:35,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/data/bb0469f0a/f6f0bb91f9344ebe8c1c56f3123694f9 [2023-11-19 07:47:35,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:35,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:35,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:35,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:35,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:35,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1ab74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35, skipping insertion in model container [2023-11-19 07:47:35,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,324 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:35,493 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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2023-11-19 07:47:35,541 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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2023-11-19 07:47:35,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:35,599 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:35,622 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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2023-11-19 07:47:35,653 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_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2023-11-19 07:47:35,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:35,701 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:35,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35 WrapperNode [2023-11-19 07:47:35,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:35,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:35,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:35,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:35,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,765 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 425 [2023-11-19 07:47:35,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:35,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:35,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:35,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:35,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:35,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:35,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:35,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:35,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (1/1) ... [2023-11-19 07:47:35,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:35,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:35,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:47:35,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:47:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-19 07:47:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-19 07:47:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-11-19 07:47:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-11-19 07:47:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-11-19 07:47:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-11-19 07:47:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-11-19 07:47:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-11-19 07:47:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-11-19 07:47:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-11-19 07:47:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-11-19 07:47:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-11-19 07:47:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-11-19 07:47:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-11-19 07:47:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-11-19 07:47:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-11-19 07:47:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-11-19 07:47:35,904 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-11-19 07:47:36,003 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:36,006 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:36,492 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:36,510 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:36,513 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-11-19 07:47:36,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:36 BoogieIcfgContainer [2023-11-19 07:47:36,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:36,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:36,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:36,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:36,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:35" (1/3) ... [2023-11-19 07:47:36,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e8899e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:36, skipping insertion in model container [2023-11-19 07:47:36,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:35" (2/3) ... [2023-11-19 07:47:36,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e8899e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:36, skipping insertion in model container [2023-11-19 07:47:36,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:36" (3/3) ... [2023-11-19 07:47:36,541 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-11-19 07:47:36,562 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:36,562 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:47:36,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:36,626 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;@4eacb704, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:36,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-19 07:47:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 153 states have internal predecessors, (227), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:47:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-19 07:47:36,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:36,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:36,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:36,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 730224026, now seen corresponding path program 1 times [2023-11-19 07:47:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596767441] [2023-11-19 07:47:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-19 07:47:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,072 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-19 07:47:37,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596767441] [2023-11-19 07:47:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596767441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948477694] [2023-11-19 07:47:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:37,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:37,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:37,117 INFO L87 Difference]: Start difference. First operand has 181 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 153 states have internal predecessors, (227), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:47:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:37,501 INFO L93 Difference]: Finished difference Result 418 states and 628 transitions. [2023-11-19 07:47:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2023-11-19 07:47:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:37,519 INFO L225 Difference]: With dead ends: 418 [2023-11-19 07:47:37,519 INFO L226 Difference]: Without dead ends: 241 [2023-11-19 07:47:37,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:37,528 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 285 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:37,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 418 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-19 07:47:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2023-11-19 07:47:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 197 states have (on average 1.401015228426396) internal successors, (276), 201 states have internal predecessors, (276), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2023-11-19 07:47:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 330 transitions. [2023-11-19 07:47:37,644 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 330 transitions. Word has length 44 [2023-11-19 07:47:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:37,645 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 330 transitions. [2023-11-19 07:47:37,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:47:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2023-11-19 07:47:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-19 07:47:37,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:37,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:37,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:47:37,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:37,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2090661330, now seen corresponding path program 1 times [2023-11-19 07:47:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277462325] [2023-11-19 07:47:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:47:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,842 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-19 07:47:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277462325] [2023-11-19 07:47:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277462325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:37,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967484147] [2023-11-19 07:47:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:37,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:37,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:37,847 INFO L87 Difference]: Start difference. First operand 235 states and 330 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:47:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:38,132 INFO L93 Difference]: Finished difference Result 483 states and 670 transitions. [2023-11-19 07:47:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:38,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-11-19 07:47:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:38,143 INFO L225 Difference]: With dead ends: 483 [2023-11-19 07:47:38,143 INFO L226 Difference]: Without dead ends: 359 [2023-11-19 07:47:38,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:38,152 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 149 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:38,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 520 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-11-19 07:47:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 302. [2023-11-19 07:47:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 258 states have (on average 1.3953488372093024) internal successors, (360), 262 states have internal predecessors, (360), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2023-11-19 07:47:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2023-11-19 07:47:38,191 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 45 [2023-11-19 07:47:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:38,191 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2023-11-19 07:47:38,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:47:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2023-11-19 07:47:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-19 07:47:38,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:38,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:38,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:47:38,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:38,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 806303869, now seen corresponding path program 1 times [2023-11-19 07:47:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:38,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875732996] [2023-11-19 07:47:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:38,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:47:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,275 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-19 07:47:38,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875732996] [2023-11-19 07:47:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875732996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:38,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:38,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936425338] [2023-11-19 07:47:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:38,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:38,279 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:47:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:38,528 INFO L93 Difference]: Finished difference Result 710 states and 979 transitions. [2023-11-19 07:47:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-11-19 07:47:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:38,534 INFO L225 Difference]: With dead ends: 710 [2023-11-19 07:47:38,534 INFO L226 Difference]: Without dead ends: 519 [2023-11-19 07:47:38,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:38,536 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 295 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:38,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 407 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-11-19 07:47:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 467. [2023-11-19 07:47:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 404 states have (on average 1.3613861386138615) internal successors, (550), 411 states have internal predecessors, (550), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2023-11-19 07:47:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 638 transitions. [2023-11-19 07:47:38,608 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 638 transitions. Word has length 45 [2023-11-19 07:47:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:38,609 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 638 transitions. [2023-11-19 07:47:38,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:47:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 638 transitions. [2023-11-19 07:47:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:38,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:38,613 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-19 07:47:38,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:47:38,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:38,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash -737201202, now seen corresponding path program 1 times [2023-11-19 07:47:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:38,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252580874] [2023-11-19 07:47:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,759 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-19 07:47:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252580874] [2023-11-19 07:47:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252580874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:38,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080252006] [2023-11-19 07:47:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:38,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:38,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:38,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:38,763 INFO L87 Difference]: Start difference. First operand 467 states and 638 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:39,242 INFO L93 Difference]: Finished difference Result 586 states and 812 transitions. [2023-11-19 07:47:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:47:39,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:39,247 INFO L225 Difference]: With dead ends: 586 [2023-11-19 07:47:39,248 INFO L226 Difference]: Without dead ends: 488 [2023-11-19 07:47:39,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:47:39,250 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 269 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:39,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 442 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-19 07:47:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 467. [2023-11-19 07:47:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 404 states have (on average 1.358910891089109) internal successors, (549), 411 states have internal predecessors, (549), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2023-11-19 07:47:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 637 transitions. [2023-11-19 07:47:39,299 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 637 transitions. Word has length 57 [2023-11-19 07:47:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:39,299 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 637 transitions. [2023-11-19 07:47:39,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 637 transitions. [2023-11-19 07:47:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:39,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:39,302 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-19 07:47:39,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:47:39,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:39,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash -721682484, now seen corresponding path program 1 times [2023-11-19 07:47:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:39,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182458065] [2023-11-19 07:47:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,455 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-19 07:47:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182458065] [2023-11-19 07:47:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182458065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400473606] [2023-11-19 07:47:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:39,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:47:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:47:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:39,458 INFO L87 Difference]: Start difference. First operand 467 states and 637 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:40,146 INFO L93 Difference]: Finished difference Result 695 states and 968 transitions. [2023-11-19 07:47:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:47:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:40,152 INFO L225 Difference]: With dead ends: 695 [2023-11-19 07:47:40,152 INFO L226 Difference]: Without dead ends: 600 [2023-11-19 07:47:40,153 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-19 07:47:40,154 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 444 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:40,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 598 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-11-19 07:47:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 559. [2023-11-19 07:47:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 479 states have (on average 1.3695198329853862) internal successors, (656), 487 states have internal predecessors, (656), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2023-11-19 07:47:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 767 transitions. [2023-11-19 07:47:40,211 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 767 transitions. Word has length 57 [2023-11-19 07:47:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:40,211 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 767 transitions. [2023-11-19 07:47:40,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 767 transitions. [2023-11-19 07:47:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:40,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:40,214 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-19 07:47:40,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:47:40,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:40,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1633634480, now seen corresponding path program 1 times [2023-11-19 07:47:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887192037] [2023-11-19 07:47:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,373 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-19 07:47:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887192037] [2023-11-19 07:47:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887192037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:40,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031017408] [2023-11-19 07:47:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:40,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:40,377 INFO L87 Difference]: Start difference. First operand 559 states and 767 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:41,201 INFO L93 Difference]: Finished difference Result 897 states and 1247 transitions. [2023-11-19 07:47:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:47:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:41,208 INFO L225 Difference]: With dead ends: 897 [2023-11-19 07:47:41,208 INFO L226 Difference]: Without dead ends: 710 [2023-11-19 07:47:41,209 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-19 07:47:41,213 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 443 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:41,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 917 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:47:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-19 07:47:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 646. [2023-11-19 07:47:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 549 states have (on average 1.3715846994535519) internal successors, (753), 558 states have internal predecessors, (753), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2023-11-19 07:47:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 886 transitions. [2023-11-19 07:47:41,290 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 886 transitions. Word has length 57 [2023-11-19 07:47:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:41,291 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 886 transitions. [2023-11-19 07:47:41,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 886 transitions. [2023-11-19 07:47:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:41,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:41,294 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-19 07:47:41,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:47:41,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:41,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 611944974, now seen corresponding path program 1 times [2023-11-19 07:47:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:41,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057084211] [2023-11-19 07:47:41,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,479 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-19 07:47:41,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:41,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057084211] [2023-11-19 07:47:41,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057084211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:41,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:41,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:41,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45324304] [2023-11-19 07:47:41,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:41,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:41,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:41,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:41,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:41,483 INFO L87 Difference]: Start difference. First operand 646 states and 886 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:42,331 INFO L93 Difference]: Finished difference Result 1214 states and 1686 transitions. [2023-11-19 07:47:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:47:42,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:42,339 INFO L225 Difference]: With dead ends: 1214 [2023-11-19 07:47:42,339 INFO L226 Difference]: Without dead ends: 940 [2023-11-19 07:47:42,341 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-19 07:47:42,344 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 451 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:42,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 901 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:47:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-19 07:47:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 808. [2023-11-19 07:47:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 679 states have (on average 1.3755522827687776) internal successors, (934), 690 states have internal predecessors, (934), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2023-11-19 07:47:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1111 transitions. [2023-11-19 07:47:42,451 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1111 transitions. Word has length 57 [2023-11-19 07:47:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1111 transitions. [2023-11-19 07:47:42,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1111 transitions. [2023-11-19 07:47:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:42,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:42,455 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-19 07:47:42,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:47:42,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:42,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash 860091468, now seen corresponding path program 1 times [2023-11-19 07:47:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:42,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117924453] [2023-11-19 07:47:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,580 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-19 07:47:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:42,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117924453] [2023-11-19 07:47:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117924453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:42,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:42,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373388663] [2023-11-19 07:47:42,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:42,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:42,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:42,584 INFO L87 Difference]: Start difference. First operand 808 states and 1111 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:43,184 INFO L93 Difference]: Finished difference Result 1401 states and 1971 transitions. [2023-11-19 07:47:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:47:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:43,191 INFO L225 Difference]: With dead ends: 1401 [2023-11-19 07:47:43,192 INFO L226 Difference]: Without dead ends: 966 [2023-11-19 07:47:43,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:47:43,220 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 216 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:43,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 805 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:47:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-11-19 07:47:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 823. [2023-11-19 07:47:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 694 states have (on average 1.3674351585014408) internal successors, (949), 705 states have internal predecessors, (949), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2023-11-19 07:47:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1126 transitions. [2023-11-19 07:47:43,295 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1126 transitions. Word has length 57 [2023-11-19 07:47:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:43,296 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1126 transitions. [2023-11-19 07:47:43,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1126 transitions. [2023-11-19 07:47:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:43,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:43,298 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-19 07:47:43,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:47:43,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:43,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 787704910, now seen corresponding path program 1 times [2023-11-19 07:47:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520480794] [2023-11-19 07:47:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,385 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-19 07:47:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520480794] [2023-11-19 07:47:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520480794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:43,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:43,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980870848] [2023-11-19 07:47:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:43,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:47:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:47:43,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:43,387 INFO L87 Difference]: Start difference. First operand 823 states and 1126 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:44,070 INFO L93 Difference]: Finished difference Result 1833 states and 2529 transitions. [2023-11-19 07:47:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:47:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:44,081 INFO L225 Difference]: With dead ends: 1833 [2023-11-19 07:47:44,081 INFO L226 Difference]: Without dead ends: 1383 [2023-11-19 07:47:44,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:47:44,085 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 585 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:44,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 696 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2023-11-19 07:47:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1224. [2023-11-19 07:47:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1021 states have (on average 1.3643486777668952) internal successors, (1393), 1036 states have internal predecessors, (1393), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2023-11-19 07:47:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1664 transitions. [2023-11-19 07:47:44,202 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1664 transitions. Word has length 57 [2023-11-19 07:47:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:44,203 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1664 transitions. [2023-11-19 07:47:44,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1664 transitions. [2023-11-19 07:47:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:44,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:44,205 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-19 07:47:44,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:47:44,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:44,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash -983766065, now seen corresponding path program 1 times [2023-11-19 07:47:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684125798] [2023-11-19 07:47:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:44,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:44,375 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-19 07:47:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684125798] [2023-11-19 07:47:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684125798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687129016] [2023-11-19 07:47:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:44,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:44,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:44,380 INFO L87 Difference]: Start difference. First operand 1224 states and 1664 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:44,983 INFO L93 Difference]: Finished difference Result 2282 states and 3143 transitions. [2023-11-19 07:47:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:47:44,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:44,993 INFO L225 Difference]: With dead ends: 2282 [2023-11-19 07:47:44,993 INFO L226 Difference]: Without dead ends: 1431 [2023-11-19 07:47:44,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:47:44,997 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 189 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:44,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 801 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2023-11-19 07:47:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1239. [2023-11-19 07:47:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1036 states have (on average 1.3542471042471043) internal successors, (1403), 1051 states have internal predecessors, (1403), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2023-11-19 07:47:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1674 transitions. [2023-11-19 07:47:45,104 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1674 transitions. Word has length 57 [2023-11-19 07:47:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:45,104 INFO L495 AbstractCegarLoop]: Abstraction has 1239 states and 1674 transitions. [2023-11-19 07:47:45,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1674 transitions. [2023-11-19 07:47:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:45,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:45,107 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-19 07:47:45,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:47:45,108 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:45,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 939461969, now seen corresponding path program 1 times [2023-11-19 07:47:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406212341] [2023-11-19 07:47:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:45,286 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-19 07:47:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406212341] [2023-11-19 07:47:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406212341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:47:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928728561] [2023-11-19 07:47:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:45,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:47:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:47:45,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:45,288 INFO L87 Difference]: Start difference. First operand 1239 states and 1674 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:45,989 INFO L93 Difference]: Finished difference Result 1795 states and 2425 transitions. [2023-11-19 07:47:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:47:45,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:45,998 INFO L225 Difference]: With dead ends: 1795 [2023-11-19 07:47:45,998 INFO L226 Difference]: Without dead ends: 1253 [2023-11-19 07:47:46,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:47:46,001 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 613 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:46,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 702 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2023-11-19 07:47:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1067. [2023-11-19 07:47:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 895 states have (on average 1.3452513966480446) internal successors, (1204), 906 states have internal predecessors, (1204), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2023-11-19 07:47:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1427 transitions. [2023-11-19 07:47:46,088 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1427 transitions. Word has length 57 [2023-11-19 07:47:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:46,088 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1427 transitions. [2023-11-19 07:47:46,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1427 transitions. [2023-11-19 07:47:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:46,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:46,093 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-19 07:47:46,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:47:46,094 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:46,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1158316687, now seen corresponding path program 1 times [2023-11-19 07:47:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680570342] [2023-11-19 07:47:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:46,290 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-19 07:47:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680570342] [2023-11-19 07:47:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680570342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:46,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:47:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502046626] [2023-11-19 07:47:46,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:47:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:47:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:46,293 INFO L87 Difference]: Start difference. First operand 1067 states and 1427 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:47,127 INFO L93 Difference]: Finished difference Result 2374 states and 3144 transitions. [2023-11-19 07:47:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:47:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:47,155 INFO L225 Difference]: With dead ends: 2374 [2023-11-19 07:47:47,155 INFO L226 Difference]: Without dead ends: 1681 [2023-11-19 07:47:47,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-11-19 07:47:47,159 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 634 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:47,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 702 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2023-11-19 07:47:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1389. [2023-11-19 07:47:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1155 states have (on average 1.3316017316017317) internal successors, (1538), 1172 states have internal predecessors, (1538), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2023-11-19 07:47:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1843 transitions. [2023-11-19 07:47:47,308 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1843 transitions. Word has length 57 [2023-11-19 07:47:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:47,308 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1843 transitions. [2023-11-19 07:47:47,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1843 transitions. [2023-11-19 07:47:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:47,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:47,314 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-19 07:47:47,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:47:47,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:47,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1581018513, now seen corresponding path program 1 times [2023-11-19 07:47:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:47,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078731061] [2023-11-19 07:47:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:47,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:47,475 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-19 07:47:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078731061] [2023-11-19 07:47:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078731061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:47:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386114919] [2023-11-19 07:47:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:47,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:47:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:47,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:47:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:47,478 INFO L87 Difference]: Start difference. First operand 1389 states and 1843 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:48,269 INFO L93 Difference]: Finished difference Result 2374 states and 3134 transitions. [2023-11-19 07:47:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:47:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-11-19 07:47:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:48,280 INFO L225 Difference]: With dead ends: 2374 [2023-11-19 07:47:48,280 INFO L226 Difference]: Without dead ends: 1657 [2023-11-19 07:47:48,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-11-19 07:47:48,284 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 616 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:48,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 698 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2023-11-19 07:47:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1379. [2023-11-19 07:47:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1149 states have (on average 1.3281114012184507) internal successors, (1526), 1162 states have internal predecessors, (1526), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2023-11-19 07:47:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1821 transitions. [2023-11-19 07:47:48,400 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1821 transitions. Word has length 57 [2023-11-19 07:47:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:48,401 INFO L495 AbstractCegarLoop]: Abstraction has 1379 states and 1821 transitions. [2023-11-19 07:47:48,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:47:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1821 transitions. [2023-11-19 07:47:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-19 07:47:48,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:48,404 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-19 07:47:48,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:47:48,404 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:48,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 763370063, now seen corresponding path program 1 times [2023-11-19 07:47:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606561835] [2023-11-19 07:47:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:48,474 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-19 07:47:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:48,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606561835] [2023-11-19 07:47:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606561835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769448170] [2023-11-19 07:47:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:48,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:48,477 INFO L87 Difference]: Start difference. First operand 1379 states and 1821 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 07:47:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:48,994 INFO L93 Difference]: Finished difference Result 3018 states and 3989 transitions. [2023-11-19 07:47:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:47:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-11-19 07:47:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:49,010 INFO L225 Difference]: With dead ends: 3018 [2023-11-19 07:47:49,011 INFO L226 Difference]: Without dead ends: 2009 [2023-11-19 07:47:49,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:47:49,015 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 461 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:49,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 439 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2023-11-19 07:47:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1791. [2023-11-19 07:47:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1479 states have (on average 1.3116970926301554) internal successors, (1940), 1502 states have internal predecessors, (1940), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2023-11-19 07:47:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2333 transitions. [2023-11-19 07:47:49,161 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2333 transitions. Word has length 57 [2023-11-19 07:47:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:49,161 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 2333 transitions. [2023-11-19 07:47:49,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 07:47:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2333 transitions. [2023-11-19 07:47:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-19 07:47:49,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:49,164 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 07:47:49,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:47:49,164 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:49,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1207485526, now seen corresponding path program 1 times [2023-11-19 07:47:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254761444] [2023-11-19 07:47:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:47:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:47:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:49,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254761444] [2023-11-19 07:47:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254761444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:49,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:49,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197741154] [2023-11-19 07:47:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:49,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:49,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:49,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:49,225 INFO L87 Difference]: Start difference. First operand 1791 states and 2333 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:49,536 INFO L93 Difference]: Finished difference Result 2375 states and 3118 transitions. [2023-11-19 07:47:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:49,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2023-11-19 07:47:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:49,549 INFO L225 Difference]: With dead ends: 2375 [2023-11-19 07:47:49,549 INFO L226 Difference]: Without dead ends: 2019 [2023-11-19 07:47:49,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:49,553 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 133 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:49,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 570 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2023-11-19 07:47:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1981. [2023-11-19 07:47:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1645 states have (on average 1.3009118541033435) internal successors, (2140), 1670 states have internal predecessors, (2140), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2023-11-19 07:47:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2571 transitions. [2023-11-19 07:47:49,704 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2571 transitions. Word has length 62 [2023-11-19 07:47:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:49,705 INFO L495 AbstractCegarLoop]: Abstraction has 1981 states and 2571 transitions. [2023-11-19 07:47:49,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2571 transitions. [2023-11-19 07:47:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-19 07:47:49,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:49,708 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 07:47:49,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:47:49,709 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:49,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -231379727, now seen corresponding path program 1 times [2023-11-19 07:47:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931762004] [2023-11-19 07:47:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:47:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-19 07:47:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-19 07:47:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931762004] [2023-11-19 07:47:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931762004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:49,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:49,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156358700] [2023-11-19 07:47:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:49,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:49,800 INFO L87 Difference]: Start difference. First operand 1981 states and 2571 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:47:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:50,125 INFO L93 Difference]: Finished difference Result 2634 states and 3424 transitions. [2023-11-19 07:47:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:50,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2023-11-19 07:47:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:50,139 INFO L225 Difference]: With dead ends: 2634 [2023-11-19 07:47:50,139 INFO L226 Difference]: Without dead ends: 2180 [2023-11-19 07:47:50,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:50,142 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 281 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:50,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 404 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2023-11-19 07:47:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2125. [2023-11-19 07:47:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1773 states have (on average 1.2921601804850535) internal successors, (2291), 1800 states have internal predecessors, (2291), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2023-11-19 07:47:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2744 transitions. [2023-11-19 07:47:50,310 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2744 transitions. Word has length 67 [2023-11-19 07:47:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:50,310 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2744 transitions. [2023-11-19 07:47:50,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:47:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2744 transitions. [2023-11-19 07:47:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-19 07:47:50,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:50,314 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 07:47:50,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:47:50,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:50,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2093542921, now seen corresponding path program 1 times [2023-11-19 07:47:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576797897] [2023-11-19 07:47:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:50,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:47:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:47:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:47:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576797897] [2023-11-19 07:47:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576797897] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967829578] [2023-11-19 07:47:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:50,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:50,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:50,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:47:50,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:47:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:50,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-19 07:47:50,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:47:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:50,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:47:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 07:47:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967829578] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:47:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2023-11-19 07:47:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143379198] [2023-11-19 07:47:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:50,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:50,754 INFO L87 Difference]: Start difference. First operand 2125 states and 2744 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:50,993 INFO L93 Difference]: Finished difference Result 2181 states and 2812 transitions. [2023-11-19 07:47:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:50,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2023-11-19 07:47:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:51,007 INFO L225 Difference]: With dead ends: 2181 [2023-11-19 07:47:51,007 INFO L226 Difference]: Without dead ends: 2178 [2023-11-19 07:47:51,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:47:51,009 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 403 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:51,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 329 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2023-11-19 07:47:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2124. [2023-11-19 07:47:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 1773 states have (on average 1.2910321489001693) internal successors, (2289), 1799 states have internal predecessors, (2289), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2023-11-19 07:47:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2741 transitions. [2023-11-19 07:47:51,214 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2741 transitions. Word has length 68 [2023-11-19 07:47:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:51,215 INFO L495 AbstractCegarLoop]: Abstraction has 2124 states and 2741 transitions. [2023-11-19 07:47:51,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2741 transitions. [2023-11-19 07:47:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-19 07:47:51,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:51,218 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 07:47:51,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:47:51,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-19 07:47:51,440 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:51,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash -475909068, now seen corresponding path program 1 times [2023-11-19 07:47:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295921320] [2023-11-19 07:47:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:47:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:47:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:47:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295921320] [2023-11-19 07:47:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295921320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162519464] [2023-11-19 07:47:51,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:51,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:47:51,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:47:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:51,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-19 07:47:51,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:47:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:51,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:47:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 07:47:51,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162519464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:47:51,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:47:51,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2023-11-19 07:47:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820014847] [2023-11-19 07:47:51,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:47:51,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:47:51,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:47:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:47:51,947 INFO L87 Difference]: Start difference. First operand 2124 states and 2741 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 07:47:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:53,169 INFO L93 Difference]: Finished difference Result 3824 states and 4961 transitions. [2023-11-19 07:47:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-19 07:47:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2023-11-19 07:47:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:53,192 INFO L225 Difference]: With dead ends: 3824 [2023-11-19 07:47:53,192 INFO L226 Difference]: Without dead ends: 3280 [2023-11-19 07:47:53,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2023-11-19 07:47:53,197 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 551 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:53,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 2158 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2023-11-19 07:47:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 2513. [2023-11-19 07:47:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2123 states have (on average 1.2826189354686763) internal successors, (2723), 2157 states have internal predecessors, (2723), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2023-11-19 07:47:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3229 transitions. [2023-11-19 07:47:53,516 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3229 transitions. Word has length 69 [2023-11-19 07:47:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:53,516 INFO L495 AbstractCegarLoop]: Abstraction has 2513 states and 3229 transitions. [2023-11-19 07:47:53,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 07:47:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3229 transitions. [2023-11-19 07:47:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 07:47:53,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:53,522 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:53,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:47:53,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-19 07:47:53,744 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:53,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1613897456, now seen corresponding path program 1 times [2023-11-19 07:47:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:53,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488751653] [2023-11-19 07:47:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:47:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:47:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 07:47:53,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488751653] [2023-11-19 07:47:53,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488751653] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:53,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241697678] [2023-11-19 07:47:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:53,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:47:53,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:47:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:47:53,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:47:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 07:47:53,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:47:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241697678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:47:53,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-19 07:47:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722881381] [2023-11-19 07:47:53,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:47:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:47:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:53,988 INFO L87 Difference]: Start difference. First operand 2513 states and 3229 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:47:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:54,205 INFO L93 Difference]: Finished difference Result 3236 states and 4167 transitions. [2023-11-19 07:47:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:54,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2023-11-19 07:47:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:54,233 INFO L225 Difference]: With dead ends: 3236 [2023-11-19 07:47:54,233 INFO L226 Difference]: Without dead ends: 2391 [2023-11-19 07:47:54,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 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-19 07:47:54,236 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 198 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:54,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 343 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2023-11-19 07:47:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2376. [2023-11-19 07:47:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2002 states have (on average 1.2812187812187812) internal successors, (2565), 2035 states have internal predecessors, (2565), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2023-11-19 07:47:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3049 transitions. [2023-11-19 07:47:54,456 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3049 transitions. Word has length 88 [2023-11-19 07:47:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:54,456 INFO L495 AbstractCegarLoop]: Abstraction has 2376 states and 3049 transitions. [2023-11-19 07:47:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:47:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3049 transitions. [2023-11-19 07:47:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 07:47:54,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:54,462 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, 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] [2023-11-19 07:47:54,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:47:54,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:54,682 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:54,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash 667474523, now seen corresponding path program 1 times [2023-11-19 07:47:54,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:54,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447841060] [2023-11-19 07:47:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:47:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:47:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:47:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-19 07:47:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:54,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447841060] [2023-11-19 07:47:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447841060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297448166] [2023-11-19 07:47:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:54,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:54,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:54,892 INFO L87 Difference]: Start difference. First operand 2376 states and 3049 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 07:47:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:55,670 INFO L93 Difference]: Finished difference Result 5551 states and 7245 transitions. [2023-11-19 07:47:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:47:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2023-11-19 07:47:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:55,689 INFO L225 Difference]: With dead ends: 5551 [2023-11-19 07:47:55,689 INFO L226 Difference]: Without dead ends: 4136 [2023-11-19 07:47:55,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:47:55,696 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 464 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:55,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 621 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:47:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2023-11-19 07:47:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3738. [2023-11-19 07:47:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 3085 states have (on average 1.2771474878444085) internal successors, (3940), 3145 states have internal predecessors, (3940), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2023-11-19 07:47:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4823 transitions. [2023-11-19 07:47:56,105 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4823 transitions. Word has length 93 [2023-11-19 07:47:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:56,105 INFO L495 AbstractCegarLoop]: Abstraction has 3738 states and 4823 transitions. [2023-11-19 07:47:56,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 07:47:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4823 transitions. [2023-11-19 07:47:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 07:47:56,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:56,113 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, 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] [2023-11-19 07:47:56,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:47:56,113 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:56,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1211656423, now seen corresponding path program 1 times [2023-11-19 07:47:56,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:56,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155450405] [2023-11-19 07:47:56,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:56,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:47:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:47:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:47:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-19 07:47:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155450405] [2023-11-19 07:47:56,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155450405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:56,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:56,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088235351] [2023-11-19 07:47:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:56,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:56,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:56,226 INFO L87 Difference]: Start difference. First operand 3738 states and 4823 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 07:47:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:56,856 INFO L93 Difference]: Finished difference Result 6185 states and 7987 transitions. [2023-11-19 07:47:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:47:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2023-11-19 07:47:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:56,872 INFO L225 Difference]: With dead ends: 6185 [2023-11-19 07:47:56,872 INFO L226 Difference]: Without dead ends: 3408 [2023-11-19 07:47:56,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:47:56,881 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 315 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:56,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 428 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2023-11-19 07:47:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 3096. [2023-11-19 07:47:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2576 states have (on average 1.2744565217391304) internal successors, (3283), 2627 states have internal predecessors, (3283), 292 states have call successors, (292), 188 states have call predecessors, (292), 226 states have return successors, (402), 282 states have call predecessors, (402), 291 states have call successors, (402) [2023-11-19 07:47:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3977 transitions. [2023-11-19 07:47:57,214 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3977 transitions. Word has length 93 [2023-11-19 07:47:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:57,214 INFO L495 AbstractCegarLoop]: Abstraction has 3096 states and 3977 transitions. [2023-11-19 07:47:57,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 07:47:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3977 transitions. [2023-11-19 07:47:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-19 07:47:57,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:57,220 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:57,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:47:57,221 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:57,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1243514336, now seen corresponding path program 1 times [2023-11-19 07:47:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:57,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780675672] [2023-11-19 07:47:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:47:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:47:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:47:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:47:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:47:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:47:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-19 07:47:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:47:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780675672] [2023-11-19 07:47:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780675672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:57,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:47:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198256541] [2023-11-19 07:47:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:57,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:47:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:47:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:57,352 INFO L87 Difference]: Start difference. First operand 3096 states and 3977 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 07:47:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:58,770 INFO L93 Difference]: Finished difference Result 6671 states and 8710 transitions. [2023-11-19 07:47:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:47:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 95 [2023-11-19 07:47:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:58,790 INFO L225 Difference]: With dead ends: 6671 [2023-11-19 07:47:58,791 INFO L226 Difference]: Without dead ends: 4536 [2023-11-19 07:47:58,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:47:58,800 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 1189 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:58,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 815 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:47:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2023-11-19 07:47:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4240. [2023-11-19 07:47:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4240 states, 3524 states have (on average 1.2551078320090805) internal successors, (4423), 3599 states have internal predecessors, (4423), 387 states have call successors, (387), 259 states have call predecessors, (387), 327 states have return successors, (558), 383 states have call predecessors, (558), 386 states have call successors, (558) [2023-11-19 07:47:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 5368 transitions. [2023-11-19 07:47:59,243 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 5368 transitions. Word has length 95 [2023-11-19 07:47:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:59,244 INFO L495 AbstractCegarLoop]: Abstraction has 4240 states and 5368 transitions. [2023-11-19 07:47:59,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 07:47:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 5368 transitions. [2023-11-19 07:47:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-19 07:47:59,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:59,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:59,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:47:59,254 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:59,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash -801124630, now seen corresponding path program 1 times [2023-11-19 07:47:59,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:59,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311069618] [2023-11-19 07:47:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:59,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:47:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:47:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:47:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:47:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-19 07:47:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311069618] [2023-11-19 07:47:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311069618] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946778717] [2023-11-19 07:47:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:59,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:59,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:59,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:47:59,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:47:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:59,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:47:59,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:47:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:47:59,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:47:59,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946778717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:59,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:47:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-19 07:47:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482073743] [2023-11-19 07:47:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:59,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:47:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:47:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:47:59,519 INFO L87 Difference]: Start difference. First operand 4240 states and 5368 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 07:47:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:59,943 INFO L93 Difference]: Finished difference Result 4619 states and 5836 transitions. [2023-11-19 07:47:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:47:59,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2023-11-19 07:47:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:59,958 INFO L225 Difference]: With dead ends: 4619 [2023-11-19 07:47:59,958 INFO L226 Difference]: Without dead ends: 3293 [2023-11-19 07:47:59,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-19 07:47:59,963 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 62 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:59,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 494 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2023-11-19 07:48:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2023-11-19 07:48:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 2680 states have (on average 1.2555970149253732) internal successors, (3365), 2739 states have internal predecessors, (3365), 330 states have call successors, (330), 222 states have call predecessors, (330), 282 states have return successors, (466), 333 states have call predecessors, (466), 330 states have call successors, (466) [2023-11-19 07:48:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4161 transitions. [2023-11-19 07:48:00,297 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4161 transitions. Word has length 103 [2023-11-19 07:48:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:00,297 INFO L495 AbstractCegarLoop]: Abstraction has 3293 states and 4161 transitions. [2023-11-19 07:48:00,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 07:48:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4161 transitions. [2023-11-19 07:48:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:48:00,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:00,303 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:00,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:00,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-19 07:48:00,516 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:00,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash -291436951, now seen corresponding path program 1 times [2023-11-19 07:48:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:00,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978284622] [2023-11-19 07:48:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:48:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:48:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:48:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:48:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:48:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:48:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:48:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-19 07:48:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-19 07:48:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978284622] [2023-11-19 07:48:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978284622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619542169] [2023-11-19 07:48:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:00,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:00,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:00,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:00,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:48:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:48:00,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-19 07:48:00,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:48:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619542169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-19 07:48:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637858057] [2023-11-19 07:48:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:00,867 INFO L87 Difference]: Start difference. First operand 3293 states and 4161 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-19 07:48:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:01,176 INFO L93 Difference]: Finished difference Result 6730 states and 8624 transitions. [2023-11-19 07:48:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 138 [2023-11-19 07:48:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:01,190 INFO L225 Difference]: With dead ends: 6730 [2023-11-19 07:48:01,190 INFO L226 Difference]: Without dead ends: 3580 [2023-11-19 07:48:01,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:01,201 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:01,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2023-11-19 07:48:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3432. [2023-11-19 07:48:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 2812 states have (on average 1.209103840682788) internal successors, (3400), 2863 states have internal predecessors, (3400), 333 states have call successors, (333), 237 states have call predecessors, (333), 286 states have return successors, (410), 333 states have call predecessors, (410), 333 states have call successors, (410) [2023-11-19 07:48:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4143 transitions. [2023-11-19 07:48:01,558 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4143 transitions. Word has length 138 [2023-11-19 07:48:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:01,558 INFO L495 AbstractCegarLoop]: Abstraction has 3432 states and 4143 transitions. [2023-11-19 07:48:01,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-19 07:48:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4143 transitions. [2023-11-19 07:48:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:48:01,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:01,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:01,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:01,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-19 07:48:01,787 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:01,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1122563028, now seen corresponding path program 1 times [2023-11-19 07:48:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220148658] [2023-11-19 07:48:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:48:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:48:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:48:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:48:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:48:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:48:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:48:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-19 07:48:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-19 07:48:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220148658] [2023-11-19 07:48:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220148658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105267683] [2023-11-19 07:48:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:01,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:01,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:01,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 07:48:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:02,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:48:02,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-19 07:48:02,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:48:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105267683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-19 07:48:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387625887] [2023-11-19 07:48:02,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:02,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:02,094 INFO L87 Difference]: Start difference. First operand 3432 states and 4143 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-19 07:48:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:02,363 INFO L93 Difference]: Finished difference Result 5627 states and 6803 transitions. [2023-11-19 07:48:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:02,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 138 [2023-11-19 07:48:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:02,372 INFO L225 Difference]: With dead ends: 5627 [2023-11-19 07:48:02,373 INFO L226 Difference]: Without dead ends: 3277 [2023-11-19 07:48:02,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:02,379 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 98 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:02,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 371 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2023-11-19 07:48:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2023-11-19 07:48:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2706 states have (on average 1.2036215816703622) internal successors, (3257), 2758 states have internal predecessors, (3257), 298 states have call successors, (298), 220 states have call predecessors, (298), 270 states have return successors, (360), 298 states have call predecessors, (360), 298 states have call successors, (360) [2023-11-19 07:48:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3915 transitions. [2023-11-19 07:48:02,717 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3915 transitions. Word has length 138 [2023-11-19 07:48:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:02,718 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 3915 transitions. [2023-11-19 07:48:02,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-19 07:48:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3915 transitions. [2023-11-19 07:48:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:48:02,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:02,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:02,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:02,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-19 07:48:02,936 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:02,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1493582248, now seen corresponding path program 1 times [2023-11-19 07:48:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740767040] [2023-11-19 07:48:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:48:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:48:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:48:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:48:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:48:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-19 07:48:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-19 07:48:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-19 07:48:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740767040] [2023-11-19 07:48:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740767040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391833440] [2023-11-19 07:48:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:03,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:03,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:03,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 07:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:03,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:48:03,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 07:48:03,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:48:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391833440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-11-19 07:48:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115601960] [2023-11-19 07:48:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:03,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:03,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:03,243 INFO L87 Difference]: Start difference. First operand 3275 states and 3915 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-19 07:48:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:03,524 INFO L93 Difference]: Finished difference Result 5466 states and 6628 transitions. [2023-11-19 07:48:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2023-11-19 07:48:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:03,535 INFO L225 Difference]: With dead ends: 5466 [2023-11-19 07:48:03,535 INFO L226 Difference]: Without dead ends: 3289 [2023-11-19 07:48:03,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 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-19 07:48:03,542 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:03,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2023-11-19 07:48:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3271. [2023-11-19 07:48:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 2702 states have (on average 1.1813471502590673) internal successors, (3192), 2754 states have internal predecessors, (3192), 298 states have call successors, (298), 220 states have call predecessors, (298), 270 states have return successors, (360), 298 states have call predecessors, (360), 298 states have call successors, (360) [2023-11-19 07:48:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 3850 transitions. [2023-11-19 07:48:03,911 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 3850 transitions. Word has length 139 [2023-11-19 07:48:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:03,912 INFO L495 AbstractCegarLoop]: Abstraction has 3271 states and 3850 transitions. [2023-11-19 07:48:03,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-19 07:48:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 3850 transitions. [2023-11-19 07:48:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:48:03,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:03,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:03,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:04,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-19 07:48:04,133 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:04,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1715579866, now seen corresponding path program 1 times [2023-11-19 07:48:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145851696] [2023-11-19 07:48:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:48:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:48:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:48:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:48:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:48:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-19 07:48:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-19 07:48:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-19 07:48:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145851696] [2023-11-19 07:48:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145851696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:48:04,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24031834] [2023-11-19 07:48:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:04,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:04,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:04,341 INFO L87 Difference]: Start difference. First operand 3271 states and 3850 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 07:48:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:05,238 INFO L93 Difference]: Finished difference Result 7001 states and 8228 transitions. [2023-11-19 07:48:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:48:05,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 140 [2023-11-19 07:48:05,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:05,252 INFO L225 Difference]: With dead ends: 7001 [2023-11-19 07:48:05,252 INFO L226 Difference]: Without dead ends: 4296 [2023-11-19 07:48:05,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:48:05,260 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 435 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:05,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 429 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:48:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2023-11-19 07:48:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3735. [2023-11-19 07:48:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 3087 states have (on average 1.1817298347910592) internal successors, (3648), 3144 states have internal predecessors, (3648), 342 states have call successors, (342), 250 states have call predecessors, (342), 305 states have return successors, (410), 342 states have call predecessors, (410), 342 states have call successors, (410) [2023-11-19 07:48:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4400 transitions. [2023-11-19 07:48:05,681 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4400 transitions. Word has length 140 [2023-11-19 07:48:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:05,681 INFO L495 AbstractCegarLoop]: Abstraction has 3735 states and 4400 transitions. [2023-11-19 07:48:05,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 07:48:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4400 transitions. [2023-11-19 07:48:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-19 07:48:05,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:05,688 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:48:05,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-19 07:48:05,689 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:05,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -575413283, now seen corresponding path program 1 times [2023-11-19 07:48:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527102357] [2023-11-19 07:48:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:48:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:48:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:48:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:48:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:48:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-19 07:48:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:48:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-19 07:48:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:48:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-19 07:48:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-19 07:48:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-19 07:48:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-19 07:48:05,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:05,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527102357] [2023-11-19 07:48:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527102357] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207557533] [2023-11-19 07:48:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:05,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:05,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:05,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:05,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-19 07:48:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:48:05,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 07:48:06,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:48:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207557533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2023-11-19 07:48:06,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5925578] [2023-11-19 07:48:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:06,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:06,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:48:06,032 INFO L87 Difference]: Start difference. First operand 3735 states and 4400 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:48:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:06,215 INFO L93 Difference]: Finished difference Result 5314 states and 6236 transitions. [2023-11-19 07:48:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:48:06,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2023-11-19 07:48:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:06,221 INFO L225 Difference]: With dead ends: 5314 [2023-11-19 07:48:06,221 INFO L226 Difference]: Without dead ends: 1593 [2023-11-19 07:48:06,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:48:06,228 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 33 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:06,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 664 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2023-11-19 07:48:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1524. [2023-11-19 07:48:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1274 states have (on average 1.1554160125588697) internal successors, (1472), 1288 states have internal predecessors, (1472), 122 states have call successors, (122), 92 states have call predecessors, (122), 127 states have return successors, (160), 143 states have call predecessors, (160), 122 states have call successors, (160) [2023-11-19 07:48:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1754 transitions. [2023-11-19 07:48:06,365 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1754 transitions. Word has length 161 [2023-11-19 07:48:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:06,366 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1754 transitions. [2023-11-19 07:48:06,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:48:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1754 transitions. [2023-11-19 07:48:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-19 07:48:06,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:06,370 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:06,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:06,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-19 07:48:06,592 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:06,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1040199976, now seen corresponding path program 1 times [2023-11-19 07:48:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:06,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802565319] [2023-11-19 07:48:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:48:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:48:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:48:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 07:48:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:48:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-19 07:48:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:48:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-19 07:48:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-19 07:48:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:48:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-19 07:48:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-19 07:48:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-19 07:48:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-19 07:48:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802565319] [2023-11-19 07:48:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802565319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971020205] [2023-11-19 07:48:06,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:06,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:06,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:06,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:06,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-19 07:48:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:07,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:48:07,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-19 07:48:07,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:48:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971020205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:07,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-19 07:48:07,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118431375] [2023-11-19 07:48:07,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:07,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:48:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:07,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:48:07,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:48:07,201 INFO L87 Difference]: Start difference. First operand 1524 states and 1754 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 07:48:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:07,395 INFO L93 Difference]: Finished difference Result 2149 states and 2521 transitions. [2023-11-19 07:48:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:07,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 166 [2023-11-19 07:48:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:07,396 INFO L225 Difference]: With dead ends: 2149 [2023-11-19 07:48:07,396 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:48:07,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:48:07,401 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:07,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 147 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:48:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:48:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:48:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:48:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:48:07,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2023-11-19 07:48:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:07,403 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:48:07,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 07:48:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:48:07,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:48:07,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-19 07:48:07,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-19 07:48:07,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:07,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-19 07:48:07,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:48:17,541 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2023-11-19 07:48:17,541 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2023-11-19 07:48:17,542 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 706 716) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse15 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (= ~m_i~0 1))) (.cse5 (and (= |old(~t1_st~0)| ~t1_st~0) .cse16)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (= ~T1_E~0 ~M_E~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< |old(~t1_st~0)| 2) .cse6 (< ~E_M~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse16 (= ~t1_st~0 0)) .cse1 .cse2 .cse3 .cse4 (not (= ~E_M~0 ~M_E~0)) (not (= ~m_pc~0 0)) .cse7 .cse8 .cse9 .cse10 (not (= ~t1_pc~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~E_1~0 2) (not (= (+ ~local~0 1) ~token~0)) .cse14)))) [2023-11-19 07:48:17,542 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-11-19 07:48:17,543 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-11-19 07:48:17,543 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-11-19 07:48:17,543 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse11 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse0 (not (= ~M_E~0 2))) (.cse1 (and .cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse2 (not (= ~E_M~0 ~M_E~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse6 (not (= ~E_1~0 ~M_E~0))) (.cse7 (not (= ~T1_E~0 ~M_E~0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)) (or .cse0 (not (= 2 |old(~c_dr_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 (and .cse11 (= ~c_dr_st~0 2)) .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or .cse0 (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse10 .cse6 .cse7 .cse8 .cse9)))) [2023-11-19 07:48:17,544 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-11-19 07:48:17,544 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-11-19 07:48:17,544 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-11-19 07:48:17,544 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-11-19 07:48:17,544 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-11-19 07:48:17,544 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggered_returnLabel#1(lines 46 64) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggered_returnLabel#1(lines 65 83) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-11-19 07:48:17,545 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2023-11-19 07:48:17,546 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2023-11-19 07:48:17,546 INFO L899 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2023-11-19 07:48:17,547 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 625 652) the Hoare annotation is: (let ((.cse0 (< ~t1_st~0 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse13 (< |old(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse4 (= ~m_st~0 0)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= (+ ~local~0 1) ~token~0)) .cse15) (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) .cse1 .cse2 .cse3 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse6 .cse7 .cse8 .cse9 (and (= ~T1_E~0 2) (= ~E_M~0 2) (= ~E_1~0 2) (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) .cse10 .cse12 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse4) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse15 .cse16))) [2023-11-19 07:48:17,547 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2023-11-19 07:48:17,547 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2023-11-19 07:48:17,547 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2023-11-19 07:48:17,547 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2023-11-19 07:48:17,548 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 681 705) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse25 (not (= (+ ~local~0 1) ~token~0))) (.cse5 (and (= |old(~t1_st~0)| ~t1_st~0) .cse19)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (< ~E_M~0 2)) (.cse24 (< ~E_1~0 2)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse20 (= ~t1_st~0 0)) (.cse21 (not (= ~E_M~0 ~M_E~0))) (.cse22 (not (= ~m_pc~0 0))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (= ~T1_E~0 ~M_E~0))) (.cse3 (= |old(~m_st~0)| 0)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 (and .cse19 .cse20) .cse1 .cse2 .cse3 .cse4 .cse21 .cse22 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse25 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse4 (and (= ~m_st~0 0) .cse20) .cse21 .cse22 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 (not (= ~E_1~0 ~M_E~0)) .cse15 (not .cse3) .cse16 .cse17)))) [2023-11-19 07:48:17,548 INFO L899 garLoopResultBuilder]: For program point is_transmit1_triggered_returnLabel#1(lines 509 527) no Hoare annotation was computed. [2023-11-19 07:48:17,548 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2023-11-19 07:48:17,548 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2023-11-19 07:48:17,549 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2023-11-19 07:48:17,549 INFO L899 garLoopResultBuilder]: For program point L505(lines 493 507) no Hoare annotation was computed. [2023-11-19 07:48:17,549 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2023-11-19 07:48:17,549 INFO L899 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2023-11-19 07:48:17,549 INFO L899 garLoopResultBuilder]: For program point is_master_triggered_returnLabel#1(lines 490 508) no Hoare annotation was computed. [2023-11-19 07:48:17,549 INFO L899 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2023-11-19 07:48:17,550 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2023-11-19 07:48:17,550 INFO L899 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2023-11-19 07:48:17,550 INFO L899 garLoopResultBuilder]: For program point L524(lines 512 526) no Hoare annotation was computed. [2023-11-19 07:48:17,550 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2023-11-19 07:48:17,550 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2023-11-19 07:48:17,550 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2023-11-19 07:48:17,550 INFO L899 garLoopResultBuilder]: For program point main1_returnLabel#1(lines 367 378) no Hoare annotation was computed. [2023-11-19 07:48:17,551 INFO L899 garLoopResultBuilder]: For program point transmit1_T1_WAIT#1(lines 457 488) no Hoare annotation was computed. [2023-11-19 07:48:17,551 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,551 INFO L899 garLoopResultBuilder]: For program point L779(lines 768 781) no Hoare annotation was computed. [2023-11-19 07:48:17,552 INFO L895 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 0))) (let ((.cse20 (= ~m_pc~0 0)) (.cse23 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse7 (= (+ ~local~0 1) ~token~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~T1_E~0 2)) (.cse10 (= ~q_free~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse11 (= ~m_i~0 1)) (.cse25 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not .cse18)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~E_M~0 2)) (.cse22 (= ~token~0 ~local~0)) (.cse24 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse4 .cse5 .cse16 .cse6 .cse8 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse14 .cse20 .cse15 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse17 .cse10 .cse11 .cse25 .cse12 .cse14 .cse20 .cse15 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse17 .cse10 .cse19 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse22 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24) (and .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse8 .cse17 .cse10 .cse19 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse21 .cse22 .cse24)))) [2023-11-19 07:48:17,552 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-11-19 07:48:17,552 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-11-19 07:48:17,552 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2023-11-19 07:48:17,552 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-11-19 07:48:17,553 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-11-19 07:48:17,554 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2023-11-19 07:48:17,554 INFO L895 garLoopResultBuilder]: At program point L798-1(lines 798 835) the Hoare annotation is: (let ((.cse15 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not .cse15)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 (= ~T1_E~0 2) .cse15 .cse9 (= ~t1_st~0 0) .cse10 .cse11 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 2) .cse16 (= ~E_1~0 2) (= ~M_E~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16)))) [2023-11-19 07:48:17,554 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~E_1~0 2) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2023-11-19 07:48:17,555 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-11-19 07:48:17,555 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2023-11-19 07:48:17,555 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 454 489) no Hoare annotation was computed. [2023-11-19 07:48:17,555 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2023-11-19 07:48:17,555 INFO L895 garLoopResultBuilder]: At program point L469-1(lines 469 482) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse13 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse8 (let ((.cse14 (= ~m_i~0 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0))) (or (and (<= 1 ~t1_pc~0) .cse14 .cse15 .cse16) (and (= ~t1_pc~0 0) .cse14 .cse15 .cse16)))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9 .cse10 .cse11 (= ~E_1~0 2) .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 (<= 2 ~E_M~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11 .cse12))) [2023-11-19 07:48:17,556 INFO L899 garLoopResultBuilder]: For program point init_model2_returnLabel#1(lines 754 763) no Hoare annotation was computed. [2023-11-19 07:48:17,556 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2023-11-19 07:48:17,556 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2023-11-19 07:48:17,556 INFO L899 garLoopResultBuilder]: For program point do_read_c_DR_WAIT_WRITE#1(lines 156 208) no Hoare annotation was computed. [2023-11-19 07:48:17,556 INFO L899 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2023-11-19 07:48:17,556 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-11-19 07:48:17,557 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 783 841) no Hoare annotation was computed. [2023-11-19 07:48:17,557 INFO L899 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2023-11-19 07:48:17,557 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2023-11-19 07:48:17,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:48:17,558 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse10))) [2023-11-19 07:48:17,558 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-11-19 07:48:17,558 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 410 453) no Hoare annotation was computed. [2023-11-19 07:48:17,558 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2023-11-19 07:48:17,558 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-11-19 07:48:17,558 INFO L899 garLoopResultBuilder]: For program point stop_simulation2_returnLabel#1(lines 764 782) no Hoare annotation was computed. [2023-11-19 07:48:17,558 INFO L899 garLoopResultBuilder]: For program point fire_time_events2_returnLabel#1(lines 717 725) no Hoare annotation was computed. [2023-11-19 07:48:17,559 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-11-19 07:48:17,559 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse10 (= ~q_free~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 (= ~c_dr_pc~0 0) .cse6 (= ~c_last_read~0 ~p_last_write~0) .cse7 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~c_num_read~0 ~p_num_write~0) .cse11 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-19 07:48:17,560 INFO L895 garLoopResultBuilder]: At program point L604-1(lines 580 618) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 0))) (let ((.cse20 (= ~m_pc~0 0)) (.cse23 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse7 (= (+ ~local~0 1) ~token~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse16 (= ~t1_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~T1_E~0 2)) (.cse10 (= ~q_free~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse11 (= ~m_i~0 1)) (.cse25 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not .cse18)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~E_M~0 2)) (.cse22 (= ~token~0 ~local~0)) (.cse24 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse4 .cse5 .cse16 .cse6 .cse8 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse14 .cse20 .cse15 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse17 .cse10 .cse11 .cse25 .cse12 .cse14 .cse20 .cse15 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse17 .cse10 .cse19 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse22 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14 .cse15 .cse24) (and .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse8 .cse17 .cse10 .cse19 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse21 .cse22 .cse24)))) [2023-11-19 07:48:17,560 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-11-19 07:48:17,560 INFO L895 garLoopResultBuilder]: At program point L439-1(lines 425 446) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse17 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and (<= 2 ~E_M~0) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse15))) .cse17) (and .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (= ~t1_st~0 0) .cse10 .cse17 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 2) .cse16 .cse15))) [2023-11-19 07:48:17,561 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~M_E~0 2))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse6 (= ~p_num_write~0 1) .cse7 .cse8 .cse9))) [2023-11-19 07:48:17,561 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-11-19 07:48:17,561 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-11-19 07:48:17,561 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-11-19 07:48:17,561 INFO L895 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,562 INFO L899 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2023-11-19 07:48:17,562 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-11-19 07:48:17,562 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse10))) [2023-11-19 07:48:17,562 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point error2_returnLabel#1(lines 386 393) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 574 624) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2023-11-19 07:48:17,563 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2023-11-19 07:48:17,564 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2023-11-19 07:48:17,564 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,564 INFO L899 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2023-11-19 07:48:17,564 INFO L899 garLoopResultBuilder]: For program point L590-1(lines 580 618) no Hoare annotation was computed. [2023-11-19 07:48:17,564 INFO L899 garLoopResultBuilder]: For program point init_model1_returnLabel#1(lines 350 366) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-11-19 07:48:17,565 INFO L899 garLoopResultBuilder]: For program point L607-2(lines 607 614) no Hoare annotation was computed. [2023-11-19 07:48:17,566 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-11-19 07:48:17,566 INFO L899 garLoopResultBuilder]: For program point stop_simulation1_returnLabel#1(lines 302 320) no Hoare annotation was computed. [2023-11-19 07:48:17,566 INFO L899 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2023-11-19 07:48:17,566 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:48:17,566 INFO L895 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,567 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2023-11-19 07:48:17,567 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-11-19 07:48:17,567 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2023-11-19 07:48:17,567 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2023-11-19 07:48:17,567 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-11-19 07:48:17,567 INFO L895 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 593 600) no Hoare annotation was computed. [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:48:17,568 INFO L899 garLoopResultBuilder]: For program point main2_returnLabel#1(lines 842 853) no Hoare annotation was computed. [2023-11-19 07:48:17,569 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse10))) [2023-11-19 07:48:17,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-11-19 07:48:17,569 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-11-19 07:48:17,569 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-11-19 07:48:17,570 INFO L899 garLoopResultBuilder]: For program point $Ultimate##101(lines 439 445) no Hoare annotation was computed. [2023-11-19 07:48:17,570 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 536 553) no Hoare annotation was computed. [2023-11-19 07:48:17,570 INFO L895 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= (+ ~local~0 1) ~token~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~q_free~0 0) (= ~m_i~0 1) (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~M_E~0 2)) [2023-11-19 07:48:17,570 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2023-11-19 07:48:17,570 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2023-11-19 07:48:17,571 INFO L895 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2023-11-19 07:48:17,571 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,571 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-11-19 07:48:17,572 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10) (and .cse12 .cse13 .cse14 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse19 .cse11 .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse10))) [2023-11-19 07:48:17,572 INFO L895 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,572 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2023-11-19 07:48:17,572 INFO L895 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2023-11-19 07:48:17,573 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-11-19 07:48:17,573 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~token~0 ~local~0)) (.cse14 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 (= ~E_M~0 2) .cse13 .cse14) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-11-19 07:48:17,573 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2023-11-19 07:48:17,573 INFO L899 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2023-11-19 07:48:17,574 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)))) [2023-11-19 07:48:17,574 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-11-19 07:48:17,574 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 726 753) no Hoare annotation was computed. [2023-11-19 07:48:17,574 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse11 (= ~q_free~0 1)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 (= ~q_free~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 (= ~p_dw_st~0 0) .cse5 .cse12 .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9))) [2023-11-19 07:48:17,574 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2023-11-19 07:48:17,574 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-11-19 07:48:17,575 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-11-19 07:48:17,575 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-11-19 07:48:17,575 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-11-19 07:48:17,575 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-11-19 07:48:17,575 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-11-19 07:48:17,575 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L899 garLoopResultBuilder]: For program point L570(lines 557 572) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2023-11-19 07:48:17,576 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 554 573) the Hoare annotation is: true [2023-11-19 07:48:17,577 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2023-11-19 07:48:17,577 INFO L899 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2023-11-19 07:48:17,577 INFO L899 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2023-11-19 07:48:17,577 INFO L899 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2023-11-19 07:48:17,577 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2023-11-19 07:48:17,577 INFO L899 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2023-11-19 07:48:17,578 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 653 680) the Hoare annotation is: (let ((.cse0 (< ~t1_st~0 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse13 (< |old(~E_1~0)| 2)) (.cse14 (< |old(~E_M~0)| 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse4 (= ~m_st~0 0)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= (+ ~local~0 1) ~token~0)) .cse15) (or (not (= |old(~E_1~0)| |old(~M_E~0)|)) .cse1 .cse2 .cse3 (not (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) .cse6 .cse7 .cse8 .cse9 (and (= ~T1_E~0 2) (= ~E_M~0 2) (= ~E_1~0 2) (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) .cse10 .cse12 (not (= |old(~T1_E~0)| |old(~M_E~0)|)) (not .cse4) (not (= ~t1_st~0 0)) (not (= 2 |old(~M_E~0)|)) .cse15 .cse16))) [2023-11-19 07:48:17,581 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, 1, 1, 1] [2023-11-19 07:48:17,583 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:48:17,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~4 [2023-11-19 07:48:17,599 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~4 [2023-11-19 07:48:17,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~4 [2023-11-19 07:48:17,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~4 [2023-11-19 07:48:17,604 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~4 [2023-11-19 07:48:17,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:48:17 BoogieIcfgContainer [2023-11-19 07:48:17,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:48:17,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:48:17,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:48:17,623 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:48:17,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:36" (3/4) ... [2023-11-19 07:48:17,625 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:48:17,629 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-19 07:48:17,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2023-11-19 07:48:17,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-11-19 07:48:17,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-11-19 07:48:17,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-11-19 07:48:17,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-11-19 07:48:17,630 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-11-19 07:48:17,631 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-11-19 07:48:17,631 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-11-19 07:48:17,655 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-19 07:48:17,660 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:48:17,661 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:48:17,662 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:48:17,860 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:48:17,861 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:48:17,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:48:17,862 INFO L158 Benchmark]: Toolchain (without parser) took 42605.99ms. Allocated memory was 132.1MB in the beginning and 1.0GB in the end (delta: 891.3MB). Free memory was 87.7MB in the beginning and 613.3MB in the end (delta: -525.6MB). Peak memory consumption was 367.8MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,862 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:48:17,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.82ms. Allocated memory is still 132.1MB. Free memory was 87.7MB in the beginning and 71.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.15ms. Allocated memory is still 132.1MB. Free memory was 71.4MB in the beginning and 68.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,863 INFO L158 Benchmark]: Boogie Preprocessor took 43.61ms. Allocated memory is still 132.1MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,863 INFO L158 Benchmark]: RCFGBuilder took 715.52ms. Allocated memory is still 132.1MB. Free memory was 66.2MB in the beginning and 97.1MB in the end (delta: -30.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,864 INFO L158 Benchmark]: TraceAbstraction took 41091.89ms. Allocated memory was 132.1MB in the beginning and 1.0GB in the end (delta: 891.3MB). Free memory was 96.4MB in the beginning and 623.8MB in the end (delta: -527.4MB). Peak memory consumption was 608.9MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,864 INFO L158 Benchmark]: Witness Printer took 238.76ms. Allocated memory is still 1.0GB. Free memory was 623.8MB in the beginning and 613.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:48:17,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 132.1MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.82ms. Allocated memory is still 132.1MB. Free memory was 87.7MB in the beginning and 71.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.15ms. Allocated memory is still 132.1MB. Free memory was 71.4MB in the beginning and 68.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.61ms. Allocated memory is still 132.1MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 715.52ms. Allocated memory is still 132.1MB. Free memory was 66.2MB in the beginning and 97.1MB in the end (delta: -30.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41091.89ms. Allocated memory was 132.1MB in the beginning and 1.0GB in the end (delta: 891.3MB). Free memory was 96.4MB in the beginning and 623.8MB in the end (delta: -527.4MB). Peak memory consumption was 608.9MB. Max. memory is 16.1GB. * Witness Printer took 238.76ms. Allocated memory is still 1.0GB. Free memory was 623.8MB in the beginning and 613.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 181 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 41.0s, OverallIterations: 29, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10375 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10096 mSDsluCounter, 17344 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11693 mSDsCounter, 1530 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9596 IncrementalHoareTripleChecker+Invalid, 11126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1530 mSolverCounterUnsat, 5651 mSDtfsCounter, 9596 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1932 GetRequests, 1632 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4240occurred in iteration=22, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 4574 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 3044 PreInvPairs, 3204 NumberOfFragments, 5216 HoareAnnotationTreeSize, 3044 FomulaSimplifications, 3153 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 37 FomulaSimplificationsInter, 17163 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3451 NumberOfCodeBlocks, 3451 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3548 ConstructedInterpolants, 0 QuantifiedInterpolants, 6688 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3443 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 40 InterpolantComputations, 28 PerfectInterpolantSequences, 1376/1478 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: (((2 <= E_M) && ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2)) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (((((1 <= t1_pc) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((t1_pc == 0) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (((((1 <= t1_pc) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((t1_pc == 0) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (((((1 <= t1_pc) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((t1_pc == 0) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && !((m_st == 0))) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (1 <= tmp)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (1 <= tmp)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || (((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (1 <= tmp)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || (((((((((((((c_num_read == p_num_write) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || ((((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || ((((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && !((m_st == 0))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) RESULT: Ultimate proved your program to be correct! [2023-11-19 07:48:17,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f8e4485-26dc-4c62-8127-c2f7b12ccb4c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE