./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme --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 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:01:58,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:01:58,560 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:01:58,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:01:58,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:01:58,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:01:58,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:01:58,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:01:58,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:01:58,623 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:01:58,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:01:58,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:01:58,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:01:58,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:01:58,628 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:01:58,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:01:58,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:01:58,629 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:01:58,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:01:58,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:01:58,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:01:58,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:01:58,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:01:58,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:01:58,632 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:01:58,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:01:58,633 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:01:58,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:01:58,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:01:58,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:01:58,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:01:58,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:58,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:01:58,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:01:58,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:01:58,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:01:58,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:01:58,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:01:58,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:01:58,638 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:01:58,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:01:58,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:01:58,639 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_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/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_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme 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 -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2023-11-26 12:01:58,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:01:58,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:01:58,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:01:58,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:01:58,959 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:01:58,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2023-11-26 12:02:02,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:02,599 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:02,601 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2023-11-26 12:02:02,622 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/data/c547cdfd3/02be34a12e514d6b9250c4467bed1ffd/FLAGcd9202b61 [2023-11-26 12:02:02,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/data/c547cdfd3/02be34a12e514d6b9250c4467bed1ffd [2023-11-26 12:02:02,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:02,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:02,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:02,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:02,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:02,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:02" (1/1) ... [2023-11-26 12:02:02,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256985de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:02, skipping insertion in model container [2023-11-26 12:02:02,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:02" (1/1) ... [2023-11-26 12:02:02,735 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:03,004 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_823c7c27-da83-48ba-aec9-74a903006e8a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2023-11-26 12:02:03,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:03,028 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:03,105 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_823c7c27-da83-48ba-aec9-74a903006e8a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2023-11-26 12:02:03,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:03,126 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:03,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03 WrapperNode [2023-11-26 12:02:03,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:03,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:03,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:03,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:03,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,231 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 500 [2023-11-26 12:02:03,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:03,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:03,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:03,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:03,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 12:02:03,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:03,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:03,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:03,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:03,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (1/1) ... [2023-11-26 12:02:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:03,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:03,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-11-26 12:02:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-11-26 12:02:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:02:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-11-26 12:02:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-11-26 12:02:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-11-26 12:02:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-11-26 12:02:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-11-26 12:02:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-11-26 12:02:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:02:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:02:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:02:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-11-26 12:02:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-11-26 12:02:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-11-26 12:02:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-11-26 12:02:03,601 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:03,605 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:04,284 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:04,341 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:04,341 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:02:04,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:04 BoogieIcfgContainer [2023-11-26 12:02:04,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:04,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:02:04,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:02:04,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:02:04,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:02:02" (1/3) ... [2023-11-26 12:02:04,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f769f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:04, skipping insertion in model container [2023-11-26 12:02:04,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:03" (2/3) ... [2023-11-26 12:02:04,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f769f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:04, skipping insertion in model container [2023-11-26 12:02:04,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:04" (3/3) ... [2023-11-26 12:02:04,351 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2023-11-26 12:02:04,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:02:04,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:02:04,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:02:04,440 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;@c442144, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:02:04,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:02:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 131 states have (on average 1.5954198473282444) internal successors, (209), 132 states have internal predecessors, (209), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-26 12:02:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 12:02:04,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:04,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:04,457 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:04,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1288314428, now seen corresponding path program 1 times [2023-11-26 12:02:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358309175] [2023-11-26 12:02:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-26 12:02:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:04,700 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-26 12:02:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358309175] [2023-11-26 12:02:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358309175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864283882] [2023-11-26 12:02:04,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:04,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:02:04,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:02:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:02:04,760 INFO L87 Difference]: Start difference. First operand has 171 states, 131 states have (on average 1.5954198473282444) internal successors, (209), 132 states have internal predecessors, (209), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 12:02:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:04,837 INFO L93 Difference]: Finished difference Result 327 states and 543 transitions. [2023-11-26 12:02:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:02:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-26 12:02:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:04,858 INFO L225 Difference]: With dead ends: 327 [2023-11-26 12:02:04,858 INFO L226 Difference]: Without dead ends: 169 [2023-11-26 12:02:04,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:02:04,877 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:04,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-26 12:02:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-11-26 12:02:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.5692307692307692) internal successors, (204), 130 states have internal predecessors, (204), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-26 12:02:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 266 transitions. [2023-11-26 12:02:04,983 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 266 transitions. Word has length 23 [2023-11-26 12:02:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:04,986 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 266 transitions. [2023-11-26 12:02:04,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 12:02:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 266 transitions. [2023-11-26 12:02:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 12:02:04,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:04,989 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] [2023-11-26 12:02:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:02:04,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:04,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -705830278, now seen corresponding path program 1 times [2023-11-26 12:02:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778803682] [2023-11-26 12:02:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-26 12:02:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:05,314 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-26 12:02:05,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778803682] [2023-11-26 12:02:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778803682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:02:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299905064] [2023-11-26 12:02:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:05,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:02:05,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:02:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:02:05,320 INFO L87 Difference]: Start difference. First operand 169 states and 266 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 12:02:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:05,512 INFO L93 Difference]: Finished difference Result 432 states and 688 transitions. [2023-11-26 12:02:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:02:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-26 12:02:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:05,517 INFO L225 Difference]: With dead ends: 432 [2023-11-26 12:02:05,517 INFO L226 Difference]: Without dead ends: 276 [2023-11-26 12:02:05,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:02:05,523 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 131 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:05,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1258 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-26 12:02:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 169. [2023-11-26 12:02:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.476923076923077) internal successors, (192), 130 states have internal predecessors, (192), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-26 12:02:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2023-11-26 12:02:05,565 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 23 [2023-11-26 12:02:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:05,565 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2023-11-26 12:02:05,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 12:02:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2023-11-26 12:02:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-26 12:02:05,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:05,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:02:05,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:05,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash 120145863, now seen corresponding path program 1 times [2023-11-26 12:02:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:05,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364808228] [2023-11-26 12:02:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:05,799 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-26 12:02:05,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:05,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364808228] [2023-11-26 12:02:05,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364808228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:05,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:05,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352106690] [2023-11-26 12:02:05,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:05,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:05,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:05,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:05,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:05,802 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 12:02:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:05,929 INFO L93 Difference]: Finished difference Result 326 states and 499 transitions. [2023-11-26 12:02:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2023-11-26 12:02:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:05,932 INFO L225 Difference]: With dead ends: 326 [2023-11-26 12:02:05,933 INFO L226 Difference]: Without dead ends: 173 [2023-11-26 12:02:05,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-26 12:02:05,935 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:05,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 719 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-26 12:02:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2023-11-26 12:02:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.4661654135338347) internal successors, (195), 133 states have internal predecessors, (195), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-26 12:02:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2023-11-26 12:02:05,961 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 34 [2023-11-26 12:02:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:05,962 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2023-11-26 12:02:05,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-26 12:02:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2023-11-26 12:02:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-26 12:02:05,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:05,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:05,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:02:05,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:05,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:05,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1571991065, now seen corresponding path program 1 times [2023-11-26 12:02:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:05,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603545285] [2023-11-26 12:02:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 12:02:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603545285] [2023-11-26 12:02:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603545285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:06,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:06,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030775469] [2023-11-26 12:02:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:06,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:06,153 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:06,221 INFO L93 Difference]: Finished difference Result 476 states and 717 transitions. [2023-11-26 12:02:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:06,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2023-11-26 12:02:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:06,232 INFO L225 Difference]: With dead ends: 476 [2023-11-26 12:02:06,233 INFO L226 Difference]: Without dead ends: 319 [2023-11-26 12:02:06,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:06,244 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 210 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:06,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 497 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-11-26 12:02:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2023-11-26 12:02:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 238 states have (on average 1.4831932773109244) internal successors, (353), 239 states have internal predecessors, (353), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-26 12:02:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 473 transitions. [2023-11-26 12:02:06,323 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 473 transitions. Word has length 48 [2023-11-26 12:02:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:06,323 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 473 transitions. [2023-11-26 12:02:06,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 473 transitions. [2023-11-26 12:02:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-26 12:02:06,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:06,334 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:06,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:02:06,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:06,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash 403632391, now seen corresponding path program 1 times [2023-11-26 12:02:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:06,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197360257] [2023-11-26 12:02:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:02:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197360257] [2023-11-26 12:02:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197360257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:06,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:06,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:02:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920350407] [2023-11-26 12:02:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:06,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:06,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:06,519 INFO L87 Difference]: Start difference. First operand 315 states and 473 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:06,614 INFO L93 Difference]: Finished difference Result 889 states and 1345 transitions. [2023-11-26 12:02:06,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:06,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2023-11-26 12:02:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:06,627 INFO L225 Difference]: With dead ends: 889 [2023-11-26 12:02:06,627 INFO L226 Difference]: Without dead ends: 590 [2023-11-26 12:02:06,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:06,633 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 211 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:06,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2023-11-26 12:02:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 584. [2023-11-26 12:02:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 435 states have (on average 1.4919540229885058) internal successors, (649), 438 states have internal predecessors, (649), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2023-11-26 12:02:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 883 transitions. [2023-11-26 12:02:06,736 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 883 transitions. Word has length 49 [2023-11-26 12:02:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:06,738 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 883 transitions. [2023-11-26 12:02:06,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2023-11-26 12:02:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-26 12:02:06,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:06,745 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:02:06,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:06,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -876231287, now seen corresponding path program 1 times [2023-11-26 12:02:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105937069] [2023-11-26 12:02:06,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:02:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105937069] [2023-11-26 12:02:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105937069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981556731] [2023-11-26 12:02:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:02:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:06,936 INFO L87 Difference]: Start difference. First operand 584 states and 883 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:07,177 INFO L93 Difference]: Finished difference Result 1241 states and 1878 transitions. [2023-11-26 12:02:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:02:07,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2023-11-26 12:02:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:07,186 INFO L225 Difference]: With dead ends: 1241 [2023-11-26 12:02:07,187 INFO L226 Difference]: Without dead ends: 673 [2023-11-26 12:02:07,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:07,191 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 352 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:07,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 646 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2023-11-26 12:02:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 665. [2023-11-26 12:02:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 503 states have (on average 1.4791252485089463) internal successors, (744), 506 states have internal predecessors, (744), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 992 transitions. [2023-11-26 12:02:07,278 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 992 transitions. Word has length 49 [2023-11-26 12:02:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:07,279 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 992 transitions. [2023-11-26 12:02:07,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 992 transitions. [2023-11-26 12:02:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-26 12:02:07,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:07,282 INFO L195 NwaCegarLoop]: trace histogram [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-26 12:02:07,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:02:07,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:07,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1026743594, now seen corresponding path program 1 times [2023-11-26 12:02:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017760804] [2023-11-26 12:02:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:07,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:02:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017760804] [2023-11-26 12:02:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017760804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:07,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:02:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238374125] [2023-11-26 12:02:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:07,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:02:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:07,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:02:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:02:07,477 INFO L87 Difference]: Start difference. First operand 665 states and 992 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:07,708 INFO L93 Difference]: Finished difference Result 1245 states and 1878 transitions. [2023-11-26 12:02:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:02:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2023-11-26 12:02:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:07,715 INFO L225 Difference]: With dead ends: 1245 [2023-11-26 12:02:07,715 INFO L226 Difference]: Without dead ends: 677 [2023-11-26 12:02:07,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:07,719 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 349 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:07,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 648 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2023-11-26 12:02:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2023-11-26 12:02:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.471624266144814) internal successors, (752), 514 states have internal predecessors, (752), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1000 transitions. [2023-11-26 12:02:07,798 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1000 transitions. Word has length 50 [2023-11-26 12:02:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:07,800 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 1000 transitions. [2023-11-26 12:02:07,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1000 transitions. [2023-11-26 12:02:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-26 12:02:07,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:07,803 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:07,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:02:07,803 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:07,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash -864045732, now seen corresponding path program 1 times [2023-11-26 12:02:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:07,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153063970] [2023-11-26 12:02:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 12:02:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:08,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153063970] [2023-11-26 12:02:08,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153063970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:08,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517572939] [2023-11-26 12:02:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:08,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:08,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:08,012 INFO L87 Difference]: Start difference. First operand 673 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:08,232 INFO L93 Difference]: Finished difference Result 1245 states and 1870 transitions. [2023-11-26 12:02:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:08,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2023-11-26 12:02:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:08,240 INFO L225 Difference]: With dead ends: 1245 [2023-11-26 12:02:08,240 INFO L226 Difference]: Without dead ends: 677 [2023-11-26 12:02:08,242 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-26 12:02:08,243 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 61 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:08,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 641 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2023-11-26 12:02:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2023-11-26 12:02:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.4637964774951076) internal successors, (748), 514 states have internal predecessors, (748), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 996 transitions. [2023-11-26 12:02:08,319 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 996 transitions. Word has length 52 [2023-11-26 12:02:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:08,319 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 996 transitions. [2023-11-26 12:02:08,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 12:02:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 996 transitions. [2023-11-26 12:02:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-26 12:02:08,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:08,321 INFO L195 NwaCegarLoop]: trace histogram [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-26 12:02:08,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:02:08,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:08,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 798524631, now seen corresponding path program 1 times [2023-11-26 12:02:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364926982] [2023-11-26 12:02:08,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:08,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364926982] [2023-11-26 12:02:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364926982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:08,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:08,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223491074] [2023-11-26 12:02:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:08,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:08,519 INFO L87 Difference]: Start difference. First operand 673 states and 996 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 12:02:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:08,630 INFO L93 Difference]: Finished difference Result 1261 states and 1890 transitions. [2023-11-26 12:02:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2023-11-26 12:02:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:08,636 INFO L225 Difference]: With dead ends: 1261 [2023-11-26 12:02:08,636 INFO L226 Difference]: Without dead ends: 693 [2023-11-26 12:02:08,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-26 12:02:08,639 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 6 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:08,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 731 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-11-26 12:02:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2023-11-26 12:02:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 527 states have (on average 1.4497153700189753) internal successors, (764), 530 states have internal predecessors, (764), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1012 transitions. [2023-11-26 12:02:08,747 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1012 transitions. Word has length 53 [2023-11-26 12:02:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:08,748 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 1012 transitions. [2023-11-26 12:02:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 12:02:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1012 transitions. [2023-11-26 12:02:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-26 12:02:08,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:08,750 INFO L195 NwaCegarLoop]: trace histogram [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-26 12:02:08,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:02:08,751 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:08,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1770618019, now seen corresponding path program 1 times [2023-11-26 12:02:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211358490] [2023-11-26 12:02:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:08,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211358490] [2023-11-26 12:02:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211358490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279393441] [2023-11-26 12:02:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:08,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:08,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:08,959 INFO L87 Difference]: Start difference. First operand 693 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-26 12:02:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:09,078 INFO L93 Difference]: Finished difference Result 1301 states and 1934 transitions. [2023-11-26 12:02:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2023-11-26 12:02:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:09,085 INFO L225 Difference]: With dead ends: 1301 [2023-11-26 12:02:09,085 INFO L226 Difference]: Without dead ends: 713 [2023-11-26 12:02:09,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-26 12:02:09,088 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 6 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:09,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 717 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-11-26 12:02:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2023-11-26 12:02:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.4364640883977902) internal successors, (780), 546 states have internal predecessors, (780), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1028 transitions. [2023-11-26 12:02:09,160 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1028 transitions. Word has length 61 [2023-11-26 12:02:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:09,161 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1028 transitions. [2023-11-26 12:02:09,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-26 12:02:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1028 transitions. [2023-11-26 12:02:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-26 12:02:09,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:09,163 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:09,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:02:09,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:09,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:09,164 INFO L85 PathProgramCache]: Analyzing trace with hash 424993415, now seen corresponding path program 1 times [2023-11-26 12:02:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565306384] [2023-11-26 12:02:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:09,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565306384] [2023-11-26 12:02:09,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565306384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:09,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119704739] [2023-11-26 12:02:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:09,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:09,367 INFO L87 Difference]: Start difference. First operand 713 states and 1028 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-26 12:02:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:09,483 INFO L93 Difference]: Finished difference Result 1337 states and 1950 transitions. [2023-11-26 12:02:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2023-11-26 12:02:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:09,489 INFO L225 Difference]: With dead ends: 1337 [2023-11-26 12:02:09,490 INFO L226 Difference]: Without dead ends: 729 [2023-11-26 12:02:09,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-26 12:02:09,493 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 5 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:09,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-11-26 12:02:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2023-11-26 12:02:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 555 states have (on average 1.427027027027027) internal successors, (792), 558 states have internal predecessors, (792), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1040 transitions. [2023-11-26 12:02:09,564 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1040 transitions. Word has length 69 [2023-11-26 12:02:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:09,564 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 1040 transitions. [2023-11-26 12:02:09,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-26 12:02:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1040 transitions. [2023-11-26 12:02:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-26 12:02:09,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:09,566 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:09,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:02:09,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:09,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1473514578, now seen corresponding path program 1 times [2023-11-26 12:02:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:09,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636886162] [2023-11-26 12:02:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 12:02:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636886162] [2023-11-26 12:02:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636886162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:09,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:09,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719232658] [2023-11-26 12:02:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:09,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:09,768 INFO L87 Difference]: Start difference. First operand 729 states and 1040 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-26 12:02:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:09,904 INFO L93 Difference]: Finished difference Result 1373 states and 1990 transitions. [2023-11-26 12:02:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:09,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2023-11-26 12:02:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:09,910 INFO L225 Difference]: With dead ends: 1373 [2023-11-26 12:02:09,911 INFO L226 Difference]: Without dead ends: 749 [2023-11-26 12:02:09,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-26 12:02:09,914 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 6 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:09,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 717 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2023-11-26 12:02:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2023-11-26 12:02:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 571 states have (on average 1.415061295971979) internal successors, (808), 574 states have internal predecessors, (808), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1056 transitions. [2023-11-26 12:02:09,987 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1056 transitions. Word has length 69 [2023-11-26 12:02:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:09,988 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1056 transitions. [2023-11-26 12:02:09,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-26 12:02:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1056 transitions. [2023-11-26 12:02:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-26 12:02:09,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:09,990 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:09,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:02:09,991 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:09,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash -625847890, now seen corresponding path program 1 times [2023-11-26 12:02:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106781462] [2023-11-26 12:02:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-26 12:02:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106781462] [2023-11-26 12:02:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106781462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872642047] [2023-11-26 12:02:10,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:10,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:10,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:10,244 INFO L87 Difference]: Start difference. First operand 749 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-26 12:02:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:10,363 INFO L93 Difference]: Finished difference Result 1417 states and 2018 transitions. [2023-11-26 12:02:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2023-11-26 12:02:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:10,370 INFO L225 Difference]: With dead ends: 1417 [2023-11-26 12:02:10,370 INFO L226 Difference]: Without dead ends: 773 [2023-11-26 12:02:10,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-26 12:02:10,373 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 7 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:10,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 728 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2023-11-26 12:02:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2023-11-26 12:02:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 591 states have (on average 1.401015228426396) internal successors, (828), 594 states have internal predecessors, (828), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-26 12:02:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1076 transitions. [2023-11-26 12:02:10,479 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1076 transitions. Word has length 77 [2023-11-26 12:02:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:10,480 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1076 transitions. [2023-11-26 12:02:10,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-26 12:02:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1076 transitions. [2023-11-26 12:02:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-26 12:02:10,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:10,485 INFO L195 NwaCegarLoop]: trace histogram [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-26 12:02:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:02:10,485 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:10,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1657714599, now seen corresponding path program 1 times [2023-11-26 12:02:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839895287] [2023-11-26 12:02:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:02:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-26 12:02:10,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839895287] [2023-11-26 12:02:10,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839895287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:10,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014785939] [2023-11-26 12:02:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:10,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:02:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:02:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:10,829 INFO L87 Difference]: Start difference. First operand 773 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-26 12:02:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:11,315 INFO L93 Difference]: Finished difference Result 2149 states and 3011 transitions. [2023-11-26 12:02:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:02:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2023-11-26 12:02:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:11,328 INFO L225 Difference]: With dead ends: 2149 [2023-11-26 12:02:11,329 INFO L226 Difference]: Without dead ends: 1481 [2023-11-26 12:02:11,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:02:11,332 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 260 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:11,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1380 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:02:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2023-11-26 12:02:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1049. [2023-11-26 12:02:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 794 states have (on average 1.3879093198992443) internal successors, (1102), 799 states have internal predecessors, (1102), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2023-11-26 12:02:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1446 transitions. [2023-11-26 12:02:11,494 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1446 transitions. Word has length 80 [2023-11-26 12:02:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:11,495 INFO L495 AbstractCegarLoop]: Abstraction has 1049 states and 1446 transitions. [2023-11-26 12:02:11,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-26 12:02:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1446 transitions. [2023-11-26 12:02:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-26 12:02:11,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:11,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:11,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:02:11,498 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:11,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:11,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1049989745, now seen corresponding path program 1 times [2023-11-26 12:02:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:11,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491880436] [2023-11-26 12:02:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:11,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-26 12:02:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-26 12:02:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491880436] [2023-11-26 12:02:11,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491880436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:11,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:11,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732536080] [2023-11-26 12:02:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:11,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:11,669 INFO L87 Difference]: Start difference. First operand 1049 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-26 12:02:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:11,812 INFO L93 Difference]: Finished difference Result 1957 states and 2718 transitions. [2023-11-26 12:02:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:11,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2023-11-26 12:02:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:11,821 INFO L225 Difference]: With dead ends: 1957 [2023-11-26 12:02:11,821 INFO L226 Difference]: Without dead ends: 1073 [2023-11-26 12:02:11,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-26 12:02:11,825 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 5 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:11,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:02:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2023-11-26 12:02:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2023-11-26 12:02:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 812 states have (on average 1.3793103448275863) internal successors, (1120), 817 states have internal predecessors, (1120), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2023-11-26 12:02:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1464 transitions. [2023-11-26 12:02:11,964 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1464 transitions. Word has length 84 [2023-11-26 12:02:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:11,965 INFO L495 AbstractCegarLoop]: Abstraction has 1073 states and 1464 transitions. [2023-11-26 12:02:11,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-26 12:02:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1464 transitions. [2023-11-26 12:02:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-26 12:02:11,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:11,967 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:11,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:02:11,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:11,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 880976071, now seen corresponding path program 1 times [2023-11-26 12:02:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689166168] [2023-11-26 12:02:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:02:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 12:02:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689166168] [2023-11-26 12:02:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689166168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:12,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:02:12,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500429738] [2023-11-26 12:02:12,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:12,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:02:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:12,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:02:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:02:12,281 INFO L87 Difference]: Start difference. First operand 1073 states and 1464 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 12:02:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:12,648 INFO L93 Difference]: Finished difference Result 1489 states and 2140 transitions. [2023-11-26 12:02:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:02:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2023-11-26 12:02:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:12,661 INFO L225 Difference]: With dead ends: 1489 [2023-11-26 12:02:12,661 INFO L226 Difference]: Without dead ends: 1487 [2023-11-26 12:02:12,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-26 12:02:12,663 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 314 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2438 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2023-11-26 12:02:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1081. [2023-11-26 12:02:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 816 states have (on average 1.3774509803921569) internal successors, (1124), 823 states have internal predecessors, (1124), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2023-11-26 12:02:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1472 transitions. [2023-11-26 12:02:12,808 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1472 transitions. Word has length 83 [2023-11-26 12:02:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:12,809 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1472 transitions. [2023-11-26 12:02:12,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 12:02:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1472 transitions. [2023-11-26 12:02:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-26 12:02:12,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:12,811 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-26 12:02:12,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:02:12,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:12,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 600868425, now seen corresponding path program 1 times [2023-11-26 12:02:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725941136] [2023-11-26 12:02:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:02:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-26 12:02:13,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725941136] [2023-11-26 12:02:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725941136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:13,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:13,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:13,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474002021] [2023-11-26 12:02:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:13,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:02:13,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:13,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:02:13,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:13,009 INFO L87 Difference]: Start difference. First operand 1081 states and 1472 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 12:02:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:13,308 INFO L93 Difference]: Finished difference Result 1955 states and 2671 transitions. [2023-11-26 12:02:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:02:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2023-11-26 12:02:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:13,317 INFO L225 Difference]: With dead ends: 1955 [2023-11-26 12:02:13,317 INFO L226 Difference]: Without dead ends: 1121 [2023-11-26 12:02:13,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:02:13,320 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 248 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:13,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1431 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2023-11-26 12:02:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1075. [2023-11-26 12:02:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 821 states have (on average 1.371498172959805) internal successors, (1126), 833 states have internal predecessors, (1126), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2023-11-26 12:02:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1450 transitions. [2023-11-26 12:02:13,453 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1450 transitions. Word has length 86 [2023-11-26 12:02:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:13,453 INFO L495 AbstractCegarLoop]: Abstraction has 1075 states and 1450 transitions. [2023-11-26 12:02:13,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-26 12:02:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1450 transitions. [2023-11-26 12:02:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 12:02:13,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:13,458 INFO L195 NwaCegarLoop]: trace histogram [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-26 12:02:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 12:02:13,459 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:13,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1743472577, now seen corresponding path program 1 times [2023-11-26 12:02:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927010934] [2023-11-26 12:02:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:13,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:02:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 12:02:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 12:02:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:13,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927010934] [2023-11-26 12:02:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927010934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513431143] [2023-11-26 12:02:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:13,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:02:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:02:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:13,799 INFO L87 Difference]: Start difference. First operand 1075 states and 1450 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 12:02:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:14,186 INFO L93 Difference]: Finished difference Result 2021 states and 2759 transitions. [2023-11-26 12:02:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:02:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2023-11-26 12:02:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:14,197 INFO L225 Difference]: With dead ends: 2021 [2023-11-26 12:02:14,197 INFO L226 Difference]: Without dead ends: 1173 [2023-11-26 12:02:14,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:02:14,201 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 198 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:14,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1594 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 12:02:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-11-26 12:02:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 967. [2023-11-26 12:02:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 740 states have (on average 1.3756756756756756) internal successors, (1018), 750 states have internal predecessors, (1018), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2023-11-26 12:02:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1308 transitions. [2023-11-26 12:02:14,367 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1308 transitions. Word has length 88 [2023-11-26 12:02:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:14,367 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1308 transitions. [2023-11-26 12:02:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-26 12:02:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1308 transitions. [2023-11-26 12:02:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-26 12:02:14,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:14,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 12:02:14,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:14,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1697658043, now seen corresponding path program 1 times [2023-11-26 12:02:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:14,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99050770] [2023-11-26 12:02:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:02:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-26 12:02:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 12:02:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-26 12:02:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 12:02:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-26 12:02:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 12:02:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 12:02:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:14,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99050770] [2023-11-26 12:02:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99050770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 12:02:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507479634] [2023-11-26 12:02:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:14,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:02:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:02:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:02:14,792 INFO L87 Difference]: Start difference. First operand 967 states and 1308 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-26 12:02:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:15,664 INFO L93 Difference]: Finished difference Result 2080 states and 2854 transitions. [2023-11-26 12:02:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:02:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2023-11-26 12:02:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:15,675 INFO L225 Difference]: With dead ends: 2080 [2023-11-26 12:02:15,675 INFO L226 Difference]: Without dead ends: 1259 [2023-11-26 12:02:15,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-26 12:02:15,678 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 745 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:15,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1421 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 12:02:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2023-11-26 12:02:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 983. [2023-11-26 12:02:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.3516042780748663) internal successors, (1011), 759 states have internal predecessors, (1011), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2023-11-26 12:02:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1307 transitions. [2023-11-26 12:02:15,832 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1307 transitions. Word has length 89 [2023-11-26 12:02:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:15,833 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1307 transitions. [2023-11-26 12:02:15,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-26 12:02:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1307 transitions. [2023-11-26 12:02:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-26 12:02:15,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:15,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:15,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 12:02:15,836 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:15,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash -934830644, now seen corresponding path program 1 times [2023-11-26 12:02:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:15,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070789360] [2023-11-26 12:02:15,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:02:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:02:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 12:02:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:02:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 12:02:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:02:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 12:02:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 12:02:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070789360] [2023-11-26 12:02:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070789360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:15,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:15,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:02:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709373281] [2023-11-26 12:02:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:15,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:15,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:15,982 INFO L87 Difference]: Start difference. First operand 983 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 12:02:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:16,303 INFO L93 Difference]: Finished difference Result 2606 states and 3483 transitions. [2023-11-26 12:02:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:02:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-11-26 12:02:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:16,316 INFO L225 Difference]: With dead ends: 2606 [2023-11-26 12:02:16,316 INFO L226 Difference]: Without dead ends: 1820 [2023-11-26 12:02:16,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-26 12:02:16,320 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 199 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:16,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1099 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 12:02:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2023-11-26 12:02:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1711. [2023-11-26 12:02:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1286 states have (on average 1.3413685847589425) internal successors, (1725), 1305 states have internal predecessors, (1725), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2023-11-26 12:02:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2269 transitions. [2023-11-26 12:02:16,561 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2269 transitions. Word has length 90 [2023-11-26 12:02:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:16,562 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2269 transitions. [2023-11-26 12:02:16,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 12:02:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2269 transitions. [2023-11-26 12:02:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-26 12:02:16,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:16,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:16,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 12:02:16,565 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:16,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash -102190207, now seen corresponding path program 1 times [2023-11-26 12:02:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22239050] [2023-11-26 12:02:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 12:02:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 12:02:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:02:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 12:02:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:02:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-26 12:02:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:02:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 12:02:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 12:02:16,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22239050] [2023-11-26 12:02:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22239050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:02:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857782759] [2023-11-26 12:02:16,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:16,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:02:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:02:16,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:02:16,917 INFO L87 Difference]: Start difference. First operand 1711 states and 2269 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 12:02:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:02:17,881 INFO L93 Difference]: Finished difference Result 3582 states and 4810 transitions. [2023-11-26 12:02:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:02:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2023-11-26 12:02:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:02:17,898 INFO L225 Difference]: With dead ends: 3582 [2023-11-26 12:02:17,898 INFO L226 Difference]: Without dead ends: 2144 [2023-11-26 12:02:17,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-26 12:02:17,904 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 576 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:02:17,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1599 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:02:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2023-11-26 12:02:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1738. [2023-11-26 12:02:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1300 states have (on average 1.3346153846153845) internal successors, (1735), 1320 states have internal predecessors, (1735), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2023-11-26 12:02:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2295 transitions. [2023-11-26 12:02:18,274 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2295 transitions. Word has length 92 [2023-11-26 12:02:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:02:18,275 INFO L495 AbstractCegarLoop]: Abstraction has 1738 states and 2295 transitions. [2023-11-26 12:02:18,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-26 12:02:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2295 transitions. [2023-11-26 12:02:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-26 12:02:18,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:02:18,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:02:18,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 12:02:18,279 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:02:18,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -499793690, now seen corresponding path program 1 times [2023-11-26 12:02:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051565797] [2023-11-26 12:02:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:18,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:02:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:02:18,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:02:18,488 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:02:18,489 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 12:02:18,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 12:02:18,496 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] [2023-11-26 12:02:18,501 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:02:18,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-26 12:02:18,605 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-26 12:02:18,607 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-26 12:02:18,610 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-26 12:02:18,617 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-26 12:02:18,623 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated [2023-11-26 12:02:18,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:02:18 BoogieIcfgContainer [2023-11-26 12:02:18,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:02:18,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:02:18,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:02:18,677 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:02:18,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:04" (3/4) ... [2023-11-26 12:02:18,679 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 12:02:18,722 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-26 12:02:18,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-26 12:02:18,729 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-26 12:02:18,730 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-26 12:02:18,731 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-26 12:02:18,732 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated [2023-11-26 12:02:18,895 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 12:02:18,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:02:18,896 INFO L158 Benchmark]: Toolchain (without parser) took 16244.85ms. Allocated memory was 144.7MB in the beginning and 480.2MB in the end (delta: 335.5MB). Free memory was 107.4MB in the beginning and 320.8MB in the end (delta: -213.4MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,897 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 109.1MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:02:18,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.20ms. Allocated memory is still 144.7MB. Free memory was 107.0MB in the beginning and 89.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.49ms. Allocated memory is still 144.7MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,904 INFO L158 Benchmark]: Boogie Preprocessor took 79.11ms. Allocated memory is still 144.7MB. Free memory was 85.7MB in the beginning and 81.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,904 INFO L158 Benchmark]: RCFGBuilder took 1029.73ms. Allocated memory is still 144.7MB. Free memory was 81.1MB in the beginning and 81.1MB in the end (delta: -43.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,905 INFO L158 Benchmark]: TraceAbstraction took 14332.30ms. Allocated memory was 144.7MB in the beginning and 480.2MB in the end (delta: 335.5MB). Free memory was 80.5MB in the beginning and 338.6MB in the end (delta: -258.1MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,905 INFO L158 Benchmark]: Witness Printer took 218.57ms. Allocated memory is still 480.2MB. Free memory was 338.6MB in the beginning and 320.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 12:02:18,910 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.33ms. Allocated memory is still 109.1MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.20ms. Allocated memory is still 144.7MB. Free memory was 107.0MB in the beginning and 89.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.49ms. Allocated memory is still 144.7MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.11ms. Allocated memory is still 144.7MB. Free memory was 85.7MB in the beginning and 81.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1029.73ms. Allocated memory is still 144.7MB. Free memory was 81.1MB in the beginning and 81.1MB in the end (delta: -43.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14332.30ms. Allocated memory was 144.7MB in the beginning and 480.2MB in the end (delta: 335.5MB). Free memory was 80.5MB in the beginning and 338.6MB in the end (delta: -258.1MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Witness Printer took 218.57ms. Allocated memory is still 480.2MB. Free memory was 338.6MB in the beginning and 320.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2_written=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, index=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3980 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3894 mSDsluCounter, 20495 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14763 mSDsCounter, 443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1780 IncrementalHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 443 mSolverCounterUnsat, 5732 mSDtfsCounter, 1780 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1738occurred in iteration=21, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 2014 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1443 NumberOfCodeBlocks, 1443 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 2915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 147/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 12:02:18,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_823c7c27-da83-48ba-aec9-74a903006e8a/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE