./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:37:30,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:37:31,075 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:37:31,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:37:31,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:37:31,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:37:31,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:37:31,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:37:31,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:37:31,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:37:31,124 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:37:31,124 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:37:31,125 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:37:31,125 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:37:31,126 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:37:31,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:37:31,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:37:31,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:37:31,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:37:31,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:37:31,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:37:31,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:37:31,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:37:31,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:37:31,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:37:31,129 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2024-11-13 23:37:31,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:37:31,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:37:31,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:37:31,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:37:31,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:37:31,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 23:37:33,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:37:33,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:37:33,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-13 23:37:33,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/data/24dc05123/29fdac7f7fd542f2b1b726508323dd2f/FLAG8d73a898b [2024-11-13 23:37:33,709 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/data/24dc05123/29fdac7f7fd542f2b1b726508323dd2f [2024-11-13 23:37:33,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:37:33,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:37:33,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:37:33,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:37:33,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:37:33,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:37:33" (1/1) ... [2024-11-13 23:37:33,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fcf4079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:33, skipping insertion in model container [2024-11-13 23:37:33,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:37:33" (1/1) ... [2024-11-13 23:37:33,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:37:34,036 WARN L250 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_84918a1b-5a51-4d3f-aae7-3ef113f5920b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-13 23:37:34,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:37:34,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:37:34,130 WARN L250 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_84918a1b-5a51-4d3f-aae7-3ef113f5920b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-13 23:37:34,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:37:34,165 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:37:34,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34 WrapperNode [2024-11-13 23:37:34,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:37:34,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:37:34,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:37:34,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:37:34,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,255 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 506 [2024-11-13 23:37:34,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:37:34,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:37:34,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:37:34,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:37:34,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:37:34,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:37:34,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:37:34,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:37:34,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (1/1) ... [2024-11-13 23:37:34,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:37:34,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:37:34,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:37:34,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:37:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-13 23:37:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-13 23:37:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:37:34,410 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-13 23:37:34,410 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-13 23:37:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-13 23:37:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:37:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-13 23:37:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:37:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:37:34,411 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-13 23:37:34,411 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-13 23:37:34,583 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:37:34,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:37:35,344 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-13 23:37:35,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:37:35,578 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:37:35,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:37:35,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:37:35 BoogieIcfgContainer [2024-11-13 23:37:35,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:37:35,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:37:35,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:37:35,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:37:35,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:37:33" (1/3) ... [2024-11-13 23:37:35,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2849e2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:37:35, skipping insertion in model container [2024-11-13 23:37:35,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:37:34" (2/3) ... [2024-11-13 23:37:35,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2849e2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:37:35, skipping insertion in model container [2024-11-13 23:37:35,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:37:35" (3/3) ... [2024-11-13 23:37:35,597 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-13 23:37:35,612 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:37:35,613 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c that has 8 procedures, 149 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:37:35,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:37:35,687 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@2b8c5b5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:37:35,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:37:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 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) [2024-11-13 23:37:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:37:35,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:35,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:37:35,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:35,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash -921747100, now seen corresponding path program 1 times [2024-11-13 23:37:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:35,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224577171] [2024-11-13 23:37:35,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:37:36,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224577171] [2024-11-13 23:37:36,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224577171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:36,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:37:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183650920] [2024-11-13 23:37:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:37:36,445 INFO L87 Difference]: Start difference. First operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 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 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-13 23:37:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:36,621 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2024-11-13 23:37:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:37:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 19 [2024-11-13 23:37:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:36,636 INFO L225 Difference]: With dead ends: 298 [2024-11-13 23:37:36,636 INFO L226 Difference]: Without dead ends: 152 [2024-11-13 23:37:36,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:36,645 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:36,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 635 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:37:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-13 23:37:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-13 23:37:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 113 states have internal predecessors, (169), 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) [2024-11-13 23:37:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-11-13 23:37:36,701 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2024-11-13 23:37:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:36,701 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-11-13 23:37:36,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-13 23:37:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-11-13 23:37:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:37:36,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:36,703 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 23:37:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:37:36,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1021669553, now seen corresponding path program 1 times [2024-11-13 23:37:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952237573] [2024-11-13 23:37:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:37:36,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952237573] [2024-11-13 23:37:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952237573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:36,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:37:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613227677] [2024-11-13 23:37:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:37:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:36,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:37:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:37,000 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2024-11-13 23:37:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:37,286 INFO L93 Difference]: Finished difference Result 337 states and 512 transitions. [2024-11-13 23:37:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:37:37,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 30 [2024-11-13 23:37:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:37,289 INFO L225 Difference]: With dead ends: 337 [2024-11-13 23:37:37,291 INFO L226 Difference]: Without dead ends: 188 [2024-11-13 23:37:37,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:37:37,294 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 324 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:37,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 572 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:37:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-13 23:37:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-13 23:37:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 141 states have internal predecessors, (213), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2024-11-13 23:37:37,340 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2024-11-13 23:37:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:37,340 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2024-11-13 23:37:37,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2024-11-13 23:37:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2024-11-13 23:37:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:37:37,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:37,343 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 23:37:37,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:37:37,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:37,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash -328840025, now seen corresponding path program 1 times [2024-11-13 23:37:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553691046] [2024-11-13 23:37:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:37:37,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553691046] [2024-11-13 23:37:37,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553691046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:37,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:37:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444294861] [2024-11-13 23:37:37,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:37:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:37:37,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:37,648 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-11-13 23:37:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:37,900 INFO L93 Difference]: Finished difference Result 336 states and 509 transitions. [2024-11-13 23:37:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:37:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 31 [2024-11-13 23:37:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:37,904 INFO L225 Difference]: With dead ends: 336 [2024-11-13 23:37:37,904 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 23:37:37,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:37:37,906 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 319 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:37,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 575 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:37:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 23:37:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-13 23:37:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.50354609929078) internal successors, (212), 141 states have internal predecessors, (212), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2024-11-13 23:37:37,938 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2024-11-13 23:37:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:37,938 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2024-11-13 23:37:37,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-11-13 23:37:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2024-11-13 23:37:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 23:37:37,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:37,940 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 23:37:37,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:37:37,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1598475538, now seen corresponding path program 1 times [2024-11-13 23:37:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114184603] [2024-11-13 23:37:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:37:38,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114184603] [2024-11-13 23:37:38,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114184603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:38,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:37:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447780297] [2024-11-13 23:37:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:38,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:38,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:38,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:37:38,292 INFO L87 Difference]: Start difference. First operand 186 states and 280 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-11-13 23:37:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:38,400 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2024-11-13 23:37:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:37:38,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 33 [2024-11-13 23:37:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:38,404 INFO L225 Difference]: With dead ends: 340 [2024-11-13 23:37:38,404 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 23:37:38,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:38,406 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 647 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:38,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 647 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:37:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 23:37:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-13 23:37:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 145 states have internal predecessors, (216), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2024-11-13 23:37:38,429 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2024-11-13 23:37:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:38,430 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2024-11-13 23:37:38,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-11-13 23:37:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2024-11-13 23:37:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-13 23:37:38,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:38,431 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 23:37:38,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:37:38,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:38,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:38,432 INFO L85 PathProgramCache]: Analyzing trace with hash -244681224, now seen corresponding path program 1 times [2024-11-13 23:37:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385831194] [2024-11-13 23:37:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:37:38,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385831194] [2024-11-13 23:37:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385831194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:37:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918920575] [2024-11-13 23:37:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:38,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:37:38,781 INFO L87 Difference]: Start difference. First operand 191 states and 284 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, (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) [2024-11-13 23:37:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:38,908 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2024-11-13 23:37:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:37:38,909 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, (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 41 [2024-11-13 23:37:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:38,911 INFO L225 Difference]: With dead ends: 350 [2024-11-13 23:37:38,911 INFO L226 Difference]: Without dead ends: 196 [2024-11-13 23:37:38,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:38,913 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 4 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:38,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:37:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-13 23:37:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-13 23:37:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2024-11-13 23:37:38,942 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2024-11-13 23:37:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:38,943 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2024-11-13 23:37:38,943 INFO L472 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, (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) [2024-11-13 23:37:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2024-11-13 23:37:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 23:37:38,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:38,947 INFO L215 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] [2024-11-13 23:37:38,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:37:38,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1779556478, now seen corresponding path program 1 times [2024-11-13 23:37:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443958646] [2024-11-13 23:37:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:37:39,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:39,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443958646] [2024-11-13 23:37:39,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443958646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:39,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:39,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:37:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476866584] [2024-11-13 23:37:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:39,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:37:39,229 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-13 23:37:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:39,334 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2024-11-13 23:37:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:37:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 49 [2024-11-13 23:37:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:39,337 INFO L225 Difference]: With dead ends: 359 [2024-11-13 23:37:39,339 INFO L226 Difference]: Without dead ends: 200 [2024-11-13 23:37:39,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:39,341 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:39,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 643 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:37:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-13 23:37:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-13 23:37:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2024-11-13 23:37:39,368 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2024-11-13 23:37:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:39,371 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2024-11-13 23:37:39,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-13 23:37:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2024-11-13 23:37:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 23:37:39,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:39,372 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 23:37:39,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 23:37:39,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:39,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 616902825, now seen corresponding path program 1 times [2024-11-13 23:37:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:39,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361604205] [2024-11-13 23:37:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:37:39,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361604205] [2024-11-13 23:37:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361604205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:39,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:39,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:37:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931660525] [2024-11-13 23:37:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:39,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:39,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:39,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:37:39,661 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-13 23:37:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:39,799 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2024-11-13 23:37:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:37:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 49 [2024-11-13 23:37:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:39,801 INFO L225 Difference]: With dead ends: 368 [2024-11-13 23:37:39,801 INFO L226 Difference]: Without dead ends: 205 [2024-11-13 23:37:39,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:37:39,803 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 4 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:39,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:37:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-13 23:37:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-13 23:37:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2024-11-13 23:37:39,819 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2024-11-13 23:37:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:39,820 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2024-11-13 23:37:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-13 23:37:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2024-11-13 23:37:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 23:37:39,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:39,821 INFO L215 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] [2024-11-13 23:37:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 23:37:39,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:39,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 681298057, now seen corresponding path program 1 times [2024-11-13 23:37:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841548200] [2024-11-13 23:37:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 23:37:40,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841548200] [2024-11-13 23:37:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841548200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:40,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:37:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:37:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125304361] [2024-11-13 23:37:40,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:37:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:37:40,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:37:40,116 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-11-13 23:37:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:40,219 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2024-11-13 23:37:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:37:40,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 57 [2024-11-13 23:37:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:40,222 INFO L225 Difference]: With dead ends: 379 [2024-11-13 23:37:40,223 INFO L226 Difference]: Without dead ends: 211 [2024-11-13 23:37:40,224 INFO L431 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 [2024-11-13 23:37:40,226 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 5 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:40,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 645 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:37:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-13 23:37:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-13 23:37:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.4409937888198758) internal successors, (232), 161 states have internal predecessors, (232), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-13 23:37:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2024-11-13 23:37:40,244 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2024-11-13 23:37:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:40,245 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2024-11-13 23:37:40,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-11-13 23:37:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2024-11-13 23:37:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-13 23:37:40,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:40,247 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 23:37:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 23:37:40,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:40,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2083388927, now seen corresponding path program 1 times [2024-11-13 23:37:40,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441199771] [2024-11-13 23:37:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:37:41,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441199771] [2024-11-13 23:37:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441199771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:37:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468894545] [2024-11-13 23:37:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:37:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:37:41,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:37:41,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:37:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:41,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 23:37:41,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:37:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:37:41,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:37:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468894545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:37:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:37:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-11-13 23:37:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259328387] [2024-11-13 23:37:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:37:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:37:41,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:37:41,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:37:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:37:41,481 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 6 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-13 23:37:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:37:41,811 INFO L93 Difference]: Finished difference Result 598 states and 836 transitions. [2024-11-13 23:37:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:37:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 6 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 60 [2024-11-13 23:37:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:37:41,814 INFO L225 Difference]: With dead ends: 598 [2024-11-13 23:37:41,817 INFO L226 Difference]: Without dead ends: 398 [2024-11-13 23:37:41,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:37:41,821 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 216 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:37:41,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1011 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:37:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-13 23:37:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-11-13 23:37:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 300 states have internal predecessors, (425), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-13 23:37:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2024-11-13 23:37:41,857 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 60 [2024-11-13 23:37:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:37:41,857 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2024-11-13 23:37:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 6 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-13 23:37:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2024-11-13 23:37:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 23:37:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:37:41,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:37:41,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 23:37:42,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 23:37:42,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:37:42,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:37:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2038727964, now seen corresponding path program 1 times [2024-11-13 23:37:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:37:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980013427] [2024-11-13 23:37:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:37:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:37:42,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:37:42,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980013427] [2024-11-13 23:37:42,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980013427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:37:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489774286] [2024-11-13 23:37:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:42,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:37:42,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:37:42,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:37:42,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 23:37:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:43,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:37:43,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:37:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:37:43,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:37:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:37:43,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489774286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:37:43,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193371121] [2024-11-13 23:37:43,823 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2024-11-13 23:37:43,823 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:37:43,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:37:43,830 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:37:43,831 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:37:57,578 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-13 23:37:57,587 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:37:57,588 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 80 for LOIs [2024-11-13 23:37:57,900 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 131 for LOIs [2024-11-13 23:37:59,291 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 106 for LOIs [2024-11-13 23:38:00,194 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-13 23:38:00,319 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:38:29,622 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7732#(and (<= 0 ~side2Failed_History_0~0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_#t~ret16#1_15| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_14| Int)) (and (= |v_ULTIMATE.start_check_#t~ret16#1_15| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_15| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_14| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret15#1_15| 0)) (<= |v_ULTIMATE.start_check_#t~ret15#1_15| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_15|) (exists ((|v_ULTIMATE.start_check_~tmp___0~0#1_15| Int)) (and (<= |v_ULTIMATE.start_check_~tmp___0~0#1_15| 127) (or (and (= ~s1p_new~0 ~nomsg~0) (= ~manual_selection_History_1~0 |v_ULTIMATE.start_check_~tmp___0~0#1_15|) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 0)) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|))) (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23|)))) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 1)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0)) (and (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (= ~manual_selection_History_1~0 |v_ULTIMATE.start_check_~tmp___0~0#1_15|) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 0)) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|))) (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23|)))) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 1)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0))) (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___0~0#1_15|)) (not (= |v_ULTIMATE.start_check_~tmp___0~0#1_15| 0)))) (= |v_ULTIMATE.start_check_~tmp___7~0#1_14| 1) (not (= (mod ~side1Failed_History_1~0 256) 0)))) (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_14| 0))) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-13 23:38:29,623 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:38:29,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:38:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-13 23:38:29,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652619787] [2024-11-13 23:38:29,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:38:29,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 23:38:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 23:38:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3442, Unknown=4, NotChecked=0, Total=3782 [2024-11-13 23:38:29,631 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 18 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-13 23:38:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:30,420 INFO L93 Difference]: Finished difference Result 1011 states and 1402 transitions. [2024-11-13 23:38:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 23:38:30,421 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 62 [2024-11-13 23:38:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:30,429 INFO L225 Difference]: With dead ends: 1011 [2024-11-13 23:38:30,429 INFO L226 Difference]: Without dead ends: 676 [2024-11-13 23:38:30,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=398, Invalid=4710, Unknown=4, NotChecked=0, Total=5112 [2024-11-13 23:38:30,434 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 262 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:30,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 3439 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:38:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-13 23:38:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 514. [2024-11-13 23:38:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 384 states have (on average 1.4140625) internal successors, (543), 387 states have internal predecessors, (543), 88 states have call successors, (88), 41 states have call predecessors, (88), 41 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 23:38:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 719 transitions. [2024-11-13 23:38:30,483 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 719 transitions. Word has length 62 [2024-11-13 23:38:30,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:30,483 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 719 transitions. [2024-11-13 23:38:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-13 23:38:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 719 transitions. [2024-11-13 23:38:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 23:38:30,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:30,485 INFO L215 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] [2024-11-13 23:38:30,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 23:38:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 23:38:30,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1789814189, now seen corresponding path program 1 times [2024-11-13 23:38:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233140334] [2024-11-13 23:38:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 23:38:30,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233140334] [2024-11-13 23:38:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233140334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:30,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:30,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917173775] [2024-11-13 23:38:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:30,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:30,865 INFO L87 Difference]: Start difference. First operand 514 states and 719 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (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) [2024-11-13 23:38:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:30,971 INFO L93 Difference]: Finished difference Result 969 states and 1355 transitions. [2024-11-13 23:38:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:38:30,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (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 66 [2024-11-13 23:38:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:30,975 INFO L225 Difference]: With dead ends: 969 [2024-11-13 23:38:30,975 INFO L226 Difference]: Without dead ends: 526 [2024-11-13 23:38:30,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:30,977 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:30,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 643 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-13 23:38:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-11-13 23:38:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 393 states have (on average 1.4045801526717556) internal successors, (552), 396 states have internal predecessors, (552), 88 states have call successors, (88), 44 states have call predecessors, (88), 44 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 23:38:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2024-11-13 23:38:31,022 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 66 [2024-11-13 23:38:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:31,023 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2024-11-13 23:38:31,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (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) [2024-11-13 23:38:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2024-11-13 23:38:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 23:38:31,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:31,025 INFO L215 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, 1, 1] [2024-11-13 23:38:31,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 23:38:31,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:31,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1876933434, now seen corresponding path program 1 times [2024-11-13 23:38:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:31,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981302040] [2024-11-13 23:38:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 23:38:31,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981302040] [2024-11-13 23:38:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981302040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:31,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:38:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783779154] [2024-11-13 23:38:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:38:31,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:38:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:38:31,693 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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) [2024-11-13 23:38:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:32,286 INFO L93 Difference]: Finished difference Result 1117 states and 1518 transitions. [2024-11-13 23:38:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:38:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 71 [2024-11-13 23:38:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:32,292 INFO L225 Difference]: With dead ends: 1117 [2024-11-13 23:38:32,292 INFO L226 Difference]: Without dead ends: 658 [2024-11-13 23:38:32,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:38:32,295 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 388 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:32,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1169 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:38:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-13 23:38:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 647. [2024-11-13 23:38:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 479 states have (on average 1.3632567849686847) internal successors, (653), 482 states have internal predecessors, (653), 109 states have call successors, (109), 58 states have call predecessors, (109), 58 states have return successors, (109), 106 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-13 23:38:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 871 transitions. [2024-11-13 23:38:32,370 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 871 transitions. Word has length 71 [2024-11-13 23:38:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:32,371 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 871 transitions. [2024-11-13 23:38:32,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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) [2024-11-13 23:38:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 871 transitions. [2024-11-13 23:38:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 23:38:32,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:32,373 INFO L215 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, 1, 1] [2024-11-13 23:38:32,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 23:38:32,374 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:32,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash -72943450, now seen corresponding path program 1 times [2024-11-13 23:38:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:32,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057507865] [2024-11-13 23:38:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:38:32,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057507865] [2024-11-13 23:38:32,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057507865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:32,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:32,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409744582] [2024-11-13 23:38:32,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:32,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:32,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:32,512 INFO L87 Difference]: Start difference. First operand 647 states and 871 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-11-13 23:38:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:32,723 INFO L93 Difference]: Finished difference Result 1576 states and 2122 transitions. [2024-11-13 23:38:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:38:32,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 71 [2024-11-13 23:38:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:32,733 INFO L225 Difference]: With dead ends: 1576 [2024-11-13 23:38:32,733 INFO L226 Difference]: Without dead ends: 1140 [2024-11-13 23:38:32,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:32,735 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 187 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:32,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 953 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-13 23:38:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1055. [2024-11-13 23:38:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 780 states have (on average 1.3525641025641026) internal successors, (1055), 786 states have internal predecessors, (1055), 178 states have call successors, (178), 96 states have call predecessors, (178), 96 states have return successors, (178), 172 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-13 23:38:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1411 transitions. [2024-11-13 23:38:32,858 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1411 transitions. Word has length 71 [2024-11-13 23:38:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:32,859 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1411 transitions. [2024-11-13 23:38:32,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-11-13 23:38:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1411 transitions. [2024-11-13 23:38:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 23:38:32,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:32,864 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:32,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 23:38:32,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:32,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1226714359, now seen corresponding path program 1 times [2024-11-13 23:38:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278295402] [2024-11-13 23:38:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 23:38:33,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278295402] [2024-11-13 23:38:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278295402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937065738] [2024-11-13 23:38:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:33,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:33,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:33,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 23:38:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:33,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 23:38:33,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 23:38:33,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:38:33,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937065738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:38:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2024-11-13 23:38:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927366638] [2024-11-13 23:38:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:33,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:38:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:38:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:38:33,926 INFO L87 Difference]: Start difference. First operand 1055 states and 1411 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 23:38:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:34,292 INFO L93 Difference]: Finished difference Result 2186 states and 3010 transitions. [2024-11-13 23:38:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:38:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-13 23:38:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:34,304 INFO L225 Difference]: With dead ends: 2186 [2024-11-13 23:38:34,305 INFO L226 Difference]: Without dead ends: 1403 [2024-11-13 23:38:34,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 23:38:34,308 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 126 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:34,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2486 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:38:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-13 23:38:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1062. [2024-11-13 23:38:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 783 states have (on average 1.342273307790549) internal successors, (1051), 791 states have internal predecessors, (1051), 180 states have call successors, (180), 98 states have call predecessors, (180), 98 states have return successors, (180), 172 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-13 23:38:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1411 transitions. [2024-11-13 23:38:34,439 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1411 transitions. Word has length 73 [2024-11-13 23:38:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:34,440 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1411 transitions. [2024-11-13 23:38:34,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 23:38:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1411 transitions. [2024-11-13 23:38:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 23:38:34,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:34,445 INFO L215 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, 1, 1, 1, 1] [2024-11-13 23:38:34,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 23:38:34,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 23:38:34,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:34,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:34,650 INFO L85 PathProgramCache]: Analyzing trace with hash -729638853, now seen corresponding path program 1 times [2024-11-13 23:38:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466362344] [2024-11-13 23:38:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 23:38:35,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466362344] [2024-11-13 23:38:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466362344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:38:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885469734] [2024-11-13 23:38:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:35,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:38:35,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:38:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:38:35,231 INFO L87 Difference]: Start difference. First operand 1062 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 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) [2024-11-13 23:38:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:36,014 INFO L93 Difference]: Finished difference Result 2496 states and 3305 transitions. [2024-11-13 23:38:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:38:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 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 73 [2024-11-13 23:38:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:36,027 INFO L225 Difference]: With dead ends: 2496 [2024-11-13 23:38:36,027 INFO L226 Difference]: Without dead ends: 1696 [2024-11-13 23:38:36,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:38:36,030 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 522 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:36,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1700 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:38:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-11-13 23:38:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1648. [2024-11-13 23:38:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1204 states have (on average 1.3264119601328903) internal successors, (1597), 1217 states have internal predecessors, (1597), 288 states have call successors, (288), 155 states have call predecessors, (288), 155 states have return successors, (288), 275 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-13 23:38:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2173 transitions. [2024-11-13 23:38:36,278 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2173 transitions. Word has length 73 [2024-11-13 23:38:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:36,279 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2173 transitions. [2024-11-13 23:38:36,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 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) [2024-11-13 23:38:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2173 transitions. [2024-11-13 23:38:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 23:38:36,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:36,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:36,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 23:38:36,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:36,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2106091589, now seen corresponding path program 1 times [2024-11-13 23:38:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:36,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838301962] [2024-11-13 23:38:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 23:38:36,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838301962] [2024-11-13 23:38:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838301962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763689675] [2024-11-13 23:38:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:36,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:36,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:36,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 23:38:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:36,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:38:36,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 23:38:36,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:38:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763689675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:38:36,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-13 23:38:36,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673039060] [2024-11-13 23:38:36,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:36,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:38:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:38:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:38:36,917 INFO L87 Difference]: Start difference. First operand 1648 states and 2173 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 23:38:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:37,275 INFO L93 Difference]: Finished difference Result 2874 states and 3799 transitions. [2024-11-13 23:38:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:38:37,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-13 23:38:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:37,288 INFO L225 Difference]: With dead ends: 2874 [2024-11-13 23:38:37,289 INFO L226 Difference]: Without dead ends: 1626 [2024-11-13 23:38:37,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:38:37,293 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 8 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:37,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1018 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-13 23:38:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2024-11-13 23:38:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1193 states have (on average 1.3017602682313496) internal successors, (1553), 1206 states have internal predecessors, (1553), 277 states have call successors, (277), 155 states have call predecessors, (277), 155 states have return successors, (277), 264 states have call predecessors, (277), 277 states have call successors, (277) [2024-11-13 23:38:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2107 transitions. [2024-11-13 23:38:37,518 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2107 transitions. Word has length 76 [2024-11-13 23:38:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:37,519 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2107 transitions. [2024-11-13 23:38:37,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-13 23:38:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2107 transitions. [2024-11-13 23:38:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 23:38:37,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:37,522 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:37,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 23:38:37,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 23:38:37,726 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:37,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash -79576832, now seen corresponding path program 1 times [2024-11-13 23:38:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492169891] [2024-11-13 23:38:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:38:37,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:37,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492169891] [2024-11-13 23:38:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492169891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:37,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:37,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015258278] [2024-11-13 23:38:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:37,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:37,836 INFO L87 Difference]: Start difference. First operand 1626 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-11-13 23:38:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:38,242 INFO L93 Difference]: Finished difference Result 3712 states and 4830 transitions. [2024-11-13 23:38:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:38:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 75 [2024-11-13 23:38:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:38,258 INFO L225 Difference]: With dead ends: 3712 [2024-11-13 23:38:38,258 INFO L226 Difference]: Without dead ends: 2627 [2024-11-13 23:38:38,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:38,261 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 187 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:38,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 721 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2024-11-13 23:38:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2344. [2024-11-13 23:38:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1717 states have (on average 1.2941176470588236) internal successors, (2222), 1735 states have internal predecessors, (2222), 404 states have call successors, (404), 222 states have call predecessors, (404), 222 states have return successors, (404), 386 states have call predecessors, (404), 404 states have call successors, (404) [2024-11-13 23:38:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3030 transitions. [2024-11-13 23:38:38,588 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3030 transitions. Word has length 75 [2024-11-13 23:38:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:38,589 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 3030 transitions. [2024-11-13 23:38:38,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-11-13 23:38:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3030 transitions. [2024-11-13 23:38:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 23:38:38,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:38,593 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:38,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 23:38:38,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1329285914, now seen corresponding path program 1 times [2024-11-13 23:38:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579802855] [2024-11-13 23:38:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:38:38,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579802855] [2024-11-13 23:38:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579802855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:38,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974714028] [2024-11-13 23:38:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:38,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:38,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:38,689 INFO L87 Difference]: Start difference. First operand 2344 states and 3030 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-11-13 23:38:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:39,154 INFO L93 Difference]: Finished difference Result 5034 states and 6532 transitions. [2024-11-13 23:38:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:38:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 75 [2024-11-13 23:38:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:39,175 INFO L225 Difference]: With dead ends: 5034 [2024-11-13 23:38:39,175 INFO L226 Difference]: Without dead ends: 3257 [2024-11-13 23:38:39,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:39,181 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 181 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:39,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1012 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2024-11-13 23:38:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3233. [2024-11-13 23:38:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 2365 states have (on average 1.2862579281183932) internal successors, (3042), 2390 states have internal predecessors, (3042), 561 states have call successors, (561), 306 states have call predecessors, (561), 306 states have return successors, (561), 536 states have call predecessors, (561), 561 states have call successors, (561) [2024-11-13 23:38:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4164 transitions. [2024-11-13 23:38:39,705 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4164 transitions. Word has length 75 [2024-11-13 23:38:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:39,706 INFO L471 AbstractCegarLoop]: Abstraction has 3233 states and 4164 transitions. [2024-11-13 23:38:39,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-11-13 23:38:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4164 transitions. [2024-11-13 23:38:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 23:38:39,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:39,710 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 23:38:39,710 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:39,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1552653658, now seen corresponding path program 1 times [2024-11-13 23:38:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293503812] [2024-11-13 23:38:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:38:39,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293503812] [2024-11-13 23:38:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293503812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:39,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:38:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992131245] [2024-11-13 23:38:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:38:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:38:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:38:39,770 INFO L87 Difference]: Start difference. First operand 3233 states and 4164 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 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) [2024-11-13 23:38:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:40,207 INFO L93 Difference]: Finished difference Result 5842 states and 7559 transitions. [2024-11-13 23:38:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:38:40,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 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 76 [2024-11-13 23:38:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:40,227 INFO L225 Difference]: With dead ends: 5842 [2024-11-13 23:38:40,227 INFO L226 Difference]: Without dead ends: 3258 [2024-11-13 23:38:40,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:38:40,234 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:40,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 402 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2024-11-13 23:38:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 3238. [2024-11-13 23:38:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 2370 states have (on average 1.2856540084388186) internal successors, (3047), 2395 states have internal predecessors, (3047), 561 states have call successors, (561), 306 states have call predecessors, (561), 306 states have return successors, (561), 536 states have call predecessors, (561), 561 states have call successors, (561) [2024-11-13 23:38:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4169 transitions. [2024-11-13 23:38:40,637 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4169 transitions. Word has length 76 [2024-11-13 23:38:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:40,637 INFO L471 AbstractCegarLoop]: Abstraction has 3238 states and 4169 transitions. [2024-11-13 23:38:40,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 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) [2024-11-13 23:38:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4169 transitions. [2024-11-13 23:38:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 23:38:40,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:40,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-13 23:38:40,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 23:38:40,641 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 943381522, now seen corresponding path program 1 times [2024-11-13 23:38:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808923905] [2024-11-13 23:38:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:40,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 23:38:41,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808923905] [2024-11-13 23:38:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808923905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500102018] [2024-11-13 23:38:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:41,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:41,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:41,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 23:38:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:41,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 23:38:41,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 23:38:41,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:38:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 23:38:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500102018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:38:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279075093] [2024-11-13 23:38:42,289 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-13 23:38:42,291 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:38:42,292 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:38:42,292 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:38:42,292 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:38:46,889 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-13 23:38:46,895 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:38:46,897 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 18 for LOIs [2024-11-13 23:38:46,909 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 72 for LOIs [2024-11-13 23:38:47,022 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 39 for LOIs [2024-11-13 23:38:47,043 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-13 23:38:47,163 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:38:57,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '66909#(and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (not (= ~active_side_History_0~0 1)) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_~tmp___12~0#1_17| Int) (|v_ULTIMATE.start_check_#t~ret20#1_18| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret11#1_17| Int) (|v_ULTIMATE.start_check_~tmp___1~0#1_16| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret11#1_17|) (not (= |v_ULTIMATE.start_check_#t~ret11#1_17| 0)) (<= |v_ULTIMATE.start_check_#t~ret11#1_17| 1) (= |v_ULTIMATE.start_check_~tmp___1~0#1_16| 1))) (<= |v_ULTIMATE.start_check_#t~ret20#1_18| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret20#1_18|) (not (= |v_ULTIMATE.start_check_#t~ret20#1_18| 0)) (= |v_ULTIMATE.start_check_~tmp___12~0#1_17| 1) (= (mod ~side1Failed_History_1~0 256) 0) (not (= ~side2Failed_History_1~0 0)))) (= ~side2_written~0 0) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-13 23:38:57,289 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:38:57,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:38:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 27 [2024-11-13 23:38:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828915335] [2024-11-13 23:38:57,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:38:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 23:38:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 23:38:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=5330, Unknown=0, NotChecked=0, Total=5700 [2024-11-13 23:38:57,292 INFO L87 Difference]: Start difference. First operand 3238 states and 4169 transitions. Second operand has 27 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 7 states have call successors, (27), 4 states have call predecessors, (27), 9 states have return successors, (26), 10 states have call predecessors, (26), 7 states have call successors, (26) [2024-11-13 23:39:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:01,179 INFO L93 Difference]: Finished difference Result 7545 states and 9644 transitions. [2024-11-13 23:39:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-13 23:39:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 7 states have call successors, (27), 4 states have call predecessors, (27), 9 states have return successors, (26), 10 states have call predecessors, (26), 7 states have call successors, (26) Word has length 78 [2024-11-13 23:39:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:01,206 INFO L225 Difference]: With dead ends: 7545 [2024-11-13 23:39:01,207 INFO L226 Difference]: Without dead ends: 4734 [2024-11-13 23:39:01,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4259 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=742, Invalid=11690, Unknown=0, NotChecked=0, Total=12432 [2024-11-13 23:39:01,221 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 884 mSDsluCounter, 6680 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 7216 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:01,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 7216 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 23:39:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4734 states. [2024-11-13 23:39:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4734 to 4131. [2024-11-13 23:39:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4131 states, 3014 states have (on average 1.2793629727936298) internal successors, (3856), 3048 states have internal predecessors, (3856), 717 states have call successors, (717), 399 states have call predecessors, (717), 399 states have return successors, (717), 683 states have call predecessors, (717), 717 states have call successors, (717) [2024-11-13 23:39:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 5290 transitions. [2024-11-13 23:39:01,795 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 5290 transitions. Word has length 78 [2024-11-13 23:39:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:01,795 INFO L471 AbstractCegarLoop]: Abstraction has 4131 states and 5290 transitions. [2024-11-13 23:39:01,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 7 states have call successors, (27), 4 states have call predecessors, (27), 9 states have return successors, (26), 10 states have call predecessors, (26), 7 states have call successors, (26) [2024-11-13 23:39:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 5290 transitions. [2024-11-13 23:39:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 23:39:01,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:01,798 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:01,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 23:39:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:01,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:01,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 204085633, now seen corresponding path program 1 times [2024-11-13 23:39:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:02,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167190784] [2024-11-13 23:39:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:39:02,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167190784] [2024-11-13 23:39:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167190784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:39:02,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5484644] [2024-11-13 23:39:02,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:39:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:39:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:39:02,358 INFO L87 Difference]: Start difference. First operand 4131 states and 5290 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 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) [2024-11-13 23:39:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:02,932 INFO L93 Difference]: Finished difference Result 7589 states and 9740 transitions. [2024-11-13 23:39:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:39:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 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 77 [2024-11-13 23:39:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:02,956 INFO L225 Difference]: With dead ends: 7589 [2024-11-13 23:39:02,960 INFO L226 Difference]: Without dead ends: 3598 [2024-11-13 23:39:02,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:39:02,968 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 57 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:02,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 623 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2024-11-13 23:39:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3598. [2024-11-13 23:39:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3598 states, 2622 states have (on average 1.284134248665141) internal successors, (3367), 2652 states have internal predecessors, (3367), 626 states have call successors, (626), 349 states have call predecessors, (626), 349 states have return successors, (626), 596 states have call predecessors, (626), 626 states have call successors, (626) [2024-11-13 23:39:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 4619 transitions. [2024-11-13 23:39:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 4619 transitions. Word has length 77 [2024-11-13 23:39:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:03,556 INFO L471 AbstractCegarLoop]: Abstraction has 3598 states and 4619 transitions. [2024-11-13 23:39:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 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) [2024-11-13 23:39:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 4619 transitions. [2024-11-13 23:39:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 23:39:03,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:03,559 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 23:39:03,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:03,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1314590680, now seen corresponding path program 1 times [2024-11-13 23:39:03,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:03,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041516090] [2024-11-13 23:39:03,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:39:03,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:03,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041516090] [2024-11-13 23:39:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041516090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:39:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047017266] [2024-11-13 23:39:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:39:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:03,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:39:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:39:03,643 INFO L87 Difference]: Start difference. First operand 3598 states and 4619 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 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) [2024-11-13 23:39:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:04,059 INFO L93 Difference]: Finished difference Result 7002 states and 9008 transitions. [2024-11-13 23:39:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:39:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 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 78 [2024-11-13 23:39:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:04,079 INFO L225 Difference]: With dead ends: 7002 [2024-11-13 23:39:04,079 INFO L226 Difference]: Without dead ends: 3604 [2024-11-13 23:39:04,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:39:04,087 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:04,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2024-11-13 23:39:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 3604. [2024-11-13 23:39:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2628 states have (on average 1.2834855403348555) internal successors, (3373), 2658 states have internal predecessors, (3373), 626 states have call successors, (626), 349 states have call predecessors, (626), 349 states have return successors, (626), 596 states have call predecessors, (626), 626 states have call successors, (626) [2024-11-13 23:39:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4625 transitions. [2024-11-13 23:39:04,593 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4625 transitions. Word has length 78 [2024-11-13 23:39:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 3604 states and 4625 transitions. [2024-11-13 23:39:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 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) [2024-11-13 23:39:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4625 transitions. [2024-11-13 23:39:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 23:39:04,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:04,595 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:04,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 23:39:04,595 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash -658768435, now seen corresponding path program 1 times [2024-11-13 23:39:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:04,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034682419] [2024-11-13 23:39:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 23:39:04,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034682419] [2024-11-13 23:39:04,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034682419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:04,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:39:04,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:39:04,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413027441] [2024-11-13 23:39:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:39:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:04,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:39:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:39:04,754 INFO L87 Difference]: Start difference. First operand 3604 states and 4625 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 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) [2024-11-13 23:39:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:05,345 INFO L93 Difference]: Finished difference Result 6924 states and 8895 transitions. [2024-11-13 23:39:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:39:05,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 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 78 [2024-11-13 23:39:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:05,370 INFO L225 Difference]: With dead ends: 6924 [2024-11-13 23:39:05,370 INFO L226 Difference]: Without dead ends: 3464 [2024-11-13 23:39:05,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:39:05,378 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 39 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:05,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 613 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2024-11-13 23:39:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3074. [2024-11-13 23:39:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2238 states have (on average 1.2797140303842716) internal successors, (2864), 2261 states have internal predecessors, (2864), 536 states have call successors, (536), 299 states have call predecessors, (536), 299 states have return successors, (536), 513 states have call predecessors, (536), 536 states have call successors, (536) [2024-11-13 23:39:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3936 transitions. [2024-11-13 23:39:05,761 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3936 transitions. Word has length 78 [2024-11-13 23:39:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:05,761 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 3936 transitions. [2024-11-13 23:39:05,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 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) [2024-11-13 23:39:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3936 transitions. [2024-11-13 23:39:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 23:39:05,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:05,763 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2024-11-13 23:39:05,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 23:39:05,764 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:05,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 889575653, now seen corresponding path program 1 times [2024-11-13 23:39:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296150582] [2024-11-13 23:39:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:39:06,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:06,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296150582] [2024-11-13 23:39:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296150582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:06,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943660147] [2024-11-13 23:39:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:06,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:06,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:06,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:39:06,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 23:39:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:06,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:39:06,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:39:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 23:39:06,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:39:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943660147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:06,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:39:06,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-13 23:39:06,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572194505] [2024-11-13 23:39:06,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:06,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:39:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:06,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:39:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:39:06,389 INFO L87 Difference]: Start difference. First operand 3074 states and 3936 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-13 23:39:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:06,859 INFO L93 Difference]: Finished difference Result 5866 states and 7548 transitions. [2024-11-13 23:39:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:39:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2024-11-13 23:39:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:06,875 INFO L225 Difference]: With dead ends: 5866 [2024-11-13 23:39:06,876 INFO L226 Difference]: Without dead ends: 3028 [2024-11-13 23:39:06,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:39:06,881 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 8 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:06,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 992 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2024-11-13 23:39:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 3028. [2024-11-13 23:39:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2215 states have (on average 1.2514672686230248) internal successors, (2772), 2238 states have internal predecessors, (2772), 513 states have call successors, (513), 299 states have call predecessors, (513), 299 states have return successors, (513), 490 states have call predecessors, (513), 513 states have call successors, (513) [2024-11-13 23:39:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3798 transitions. [2024-11-13 23:39:07,225 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3798 transitions. Word has length 92 [2024-11-13 23:39:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:07,226 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 3798 transitions. [2024-11-13 23:39:07,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-13 23:39:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3798 transitions. [2024-11-13 23:39:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 23:39:07,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:07,228 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 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] [2024-11-13 23:39:07,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 23:39:07,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 23:39:07,433 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 333262592, now seen corresponding path program 1 times [2024-11-13 23:39:07,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:07,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363264889] [2024-11-13 23:39:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 23:39:07,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363264889] [2024-11-13 23:39:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363264889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093881143] [2024-11-13 23:39:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:07,937 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:39:07,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 23:39:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:08,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:39:08,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:39:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 23:39:08,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:39:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093881143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:39:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:39:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-13 23:39:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044779298] [2024-11-13 23:39:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:39:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:39:08,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:39:08,247 INFO L87 Difference]: Start difference. First operand 3028 states and 3798 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:39:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:08,904 INFO L93 Difference]: Finished difference Result 5726 states and 7221 transitions. [2024-11-13 23:39:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:39:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 23:39:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:08,921 INFO L225 Difference]: With dead ends: 5726 [2024-11-13 23:39:08,921 INFO L226 Difference]: Without dead ends: 2982 [2024-11-13 23:39:08,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:39:08,928 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:08,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 972 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2024-11-13 23:39:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2907. [2024-11-13 23:39:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2138 states have (on average 1.2212347988774557) internal successors, (2611), 2161 states have internal predecessors, (2611), 478 states have call successors, (478), 290 states have call predecessors, (478), 290 states have return successors, (478), 455 states have call predecessors, (478), 478 states have call successors, (478) [2024-11-13 23:39:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3567 transitions. [2024-11-13 23:39:09,316 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3567 transitions. Word has length 108 [2024-11-13 23:39:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:09,317 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 3567 transitions. [2024-11-13 23:39:09,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:39:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3567 transitions. [2024-11-13 23:39:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-13 23:39:09,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:09,321 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:09,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 23:39:09,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 23:39:09,521 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 696062107, now seen corresponding path program 1 times [2024-11-13 23:39:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970087332] [2024-11-13 23:39:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-13 23:39:09,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970087332] [2024-11-13 23:39:09,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970087332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939365562] [2024-11-13 23:39:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:09,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:09,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:09,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:39:09,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 23:39:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:10,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 23:39:10,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:39:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 23:39:10,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:39:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 23:39:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939365562] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:39:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 6] total 15 [2024-11-13 23:39:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770298155] [2024-11-13 23:39:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:39:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:39:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:39:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:39:10,345 INFO L87 Difference]: Start difference. First operand 2907 states and 3567 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 23:39:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:39:10,733 INFO L93 Difference]: Finished difference Result 5443 states and 6730 transitions. [2024-11-13 23:39:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:39:10,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2024-11-13 23:39:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:39:10,749 INFO L225 Difference]: With dead ends: 5443 [2024-11-13 23:39:10,750 INFO L226 Difference]: Without dead ends: 2847 [2024-11-13 23:39:10,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-13 23:39:10,754 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 4 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:39:10,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 596 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:39:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2024-11-13 23:39:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2681. [2024-11-13 23:39:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 1970 states have (on average 1.1989847715736042) internal successors, (2362), 1993 states have internal predecessors, (2362), 439 states have call successors, (439), 271 states have call predecessors, (439), 271 states have return successors, (439), 416 states have call predecessors, (439), 439 states have call successors, (439) [2024-11-13 23:39:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3240 transitions. [2024-11-13 23:39:11,065 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3240 transitions. Word has length 124 [2024-11-13 23:39:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:39:11,067 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 3240 transitions. [2024-11-13 23:39:11,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 23:39:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3240 transitions. [2024-11-13 23:39:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 23:39:11,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:39:11,071 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:39:11,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 23:39:11,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 23:39:11,275 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:39:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:39:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1598095994, now seen corresponding path program 1 times [2024-11-13 23:39:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:39:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840805261] [2024-11-13 23:39:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:39:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 23:39:11,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840805261] [2024-11-13 23:39:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840805261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049859067] [2024-11-13 23:39:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:39:11,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:11,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:11,683 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:39:11,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 23:39:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:11,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 23:39:11,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:39:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 23:39:12,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:39:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 23:39:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049859067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:39:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921809132] [2024-11-13 23:39:12,449 INFO L159 IcfgInterpreter]: Started Sifa with 86 locations of interest [2024-11-13 23:39:12,449 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:39:12,449 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:39:12,450 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:39:12,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:39:25,317 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-13 23:39:25,337 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:39:25,337 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 20 for LOIs [2024-11-13 23:39:25,365 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 212 for LOIs [2024-11-13 23:39:25,822 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 190 for LOIs [2024-11-13 23:39:27,901 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 24 for LOIs [2024-11-13 23:39:27,918 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:40:19,087 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '163843#(and (<= 0 ~side2Failed_History_0~0) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_#t~ret28#1_19| Int) (|v_ULTIMATE.start_check_~tmp___17~0#1_17| Int) (|v_ULTIMATE.start_check_~tmp___16~0#1_17| Int) (|v_ULTIMATE.start_check_#t~ret27#1_19| Int)) (and (or (and (not (= |v_ULTIMATE.start_check_#t~ret27#1_19| 0)) (= |v_ULTIMATE.start_check_~tmp___16~0#1_17| 1)) (and (= |v_ULTIMATE.start_check_#t~ret27#1_19| 0) (= |v_ULTIMATE.start_check_~tmp___16~0#1_17| 0))) (= |v_ULTIMATE.start_check_~tmp___17~0#1_17| |v_ULTIMATE.start_check_~tmp___16~0#1_17|) (<= |v_ULTIMATE.start_check_#t~ret27#1_19| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret27#1_19|) (<= 0 |v_ULTIMATE.start_check_#t~ret28#1_19|) (<= |v_ULTIMATE.start_check_#t~ret28#1_19| 1) (or (and (= |v_ULTIMATE.start_check_~tmp___17~0#1_17| 1) (not (= |v_ULTIMATE.start_check_#t~ret28#1_19| 0))) (and (= |v_ULTIMATE.start_check_~tmp___17~0#1_17| 0) (= |v_ULTIMATE.start_check_#t~ret28#1_19| 0))))) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_#t~ret26#1_19| Int) (|v_ULTIMATE.start_check_~tmp___14~0#1_17| Int) (|v_ULTIMATE.start_check_~tmp___15~0#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret26#1_19|) (or (and (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (exists ((|v_ULTIMATE.start_check_#t~ret12#1_19| Int) (|v_ULTIMATE.start_check_~tmp___2~0#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_19|) (= |v_ULTIMATE.start_check_~tmp___2~0#1_17| 1) (<= |v_ULTIMATE.start_check_#t~ret12#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret12#1_19| 0)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_19| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_19|) (<= |v_ULTIMATE.start_check_#t~ret25#1_19| 1) (or (and (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0) (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 0)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 1) (not (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0)))))) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret11#1_23| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_23| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_20| 0))) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_25| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_21| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_25| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_21| 0))) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28| Int)) (and (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 0)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 1)) (or (and (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|)) (= ~active_side_History_0~0 0)) (and (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|))) (and (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|) (= 2 ~active_side_History_0~0))))))) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret19#1_23| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret19#1_23| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret19#1_23|) (not (= |v_ULTIMATE.start_check_#t~ret19#1_23| 0)) (= |v_ULTIMATE.start_check_~tmp___11~0#1_20| 1))) (= ~nomsg~0 ~s1s2_new~0)) (and (= ~s1p_new~0 ~nomsg~0) (exists ((|v_ULTIMATE.start_check_#t~ret12#1_19| Int) (|v_ULTIMATE.start_check_~tmp___2~0#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_19|) (= |v_ULTIMATE.start_check_~tmp___2~0#1_17| 1) (<= |v_ULTIMATE.start_check_#t~ret12#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret12#1_19| 0)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= ~nomsg~0 ~s2p_new~0) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_19| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_19|) (<= |v_ULTIMATE.start_check_#t~ret25#1_19| 1) (or (and (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0) (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 0)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 1) (not (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0)))))) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret11#1_23| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_23| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_20| 0))) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_25| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_21| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_25| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_21| 0))) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28| Int)) (and (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 0)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 1)) (or (and (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|)) (= ~active_side_History_0~0 0)) (and (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|))) (and (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|) (= 2 ~active_side_History_0~0))))))) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (= ~nomsg~0 ~cs2_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret19#1_23| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret19#1_23| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret19#1_23|) (not (= |v_ULTIMATE.start_check_#t~ret19#1_23| 0)) (= |v_ULTIMATE.start_check_~tmp___11~0#1_20| 1))) (= ~nomsg~0 ~s1s2_new~0))) (<= |v_ULTIMATE.start_check_#t~ret26#1_19| 1) (or (and (= |v_ULTIMATE.start_check_~tmp___15~0#1_17| 0) (= |v_ULTIMATE.start_check_#t~ret26#1_19| 0)) (and (not (= |v_ULTIMATE.start_check_#t~ret26#1_19| 0)) (= |v_ULTIMATE.start_check_~tmp___15~0#1_17| 1))) (= |v_ULTIMATE.start_check_~tmp___15~0#1_17| |v_ULTIMATE.start_check_~tmp___14~0#1_17|))) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___19~0#1_17| Int) (|v_ULTIMATE.start_check_~tmp___18~0#1_17| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___19~0#1_17|)) (not (= |v_ULTIMATE.start_check_~tmp___18~0#1_17| |v_ULTIMATE.start_check_~tmp___19~0#1_17|)) (<= 0 (+ |v_ULTIMATE.start_check_~tmp___18~0#1_17| 128)) (<= |v_ULTIMATE.start_check_~tmp___18~0#1_17| 127) (<= |v_ULTIMATE.start_check_~tmp___19~0#1_17| 127))) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-13 23:40:19,087 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:40:19,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:40:19,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 26 [2024-11-13 23:40:19,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562489612] [2024-11-13 23:40:19,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:40:19,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 23:40:19,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 23:40:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=7332, Unknown=0, NotChecked=0, Total=7832 [2024-11-13 23:40:19,091 INFO L87 Difference]: Start difference. First operand 2681 states and 3240 transitions. Second operand has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 21 states have internal predecessors, (149), 7 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-13 23:40:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:22,213 INFO L93 Difference]: Finished difference Result 6509 states and 7896 transitions. [2024-11-13 23:40:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-13 23:40:22,213 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 21 states have internal predecessors, (149), 7 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) Word has length 134 [2024-11-13 23:40:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:22,238 INFO L225 Difference]: With dead ends: 6509 [2024-11-13 23:40:22,238 INFO L226 Difference]: Without dead ends: 3995 [2024-11-13 23:40:22,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 313 SyntacticMatches, 14 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4701 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=829, Invalid=13691, Unknown=0, NotChecked=0, Total=14520 [2024-11-13 23:40:22,250 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1205 mSDsluCounter, 5015 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:22,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 5330 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 23:40:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2024-11-13 23:40:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3634. [2024-11-13 23:40:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 2662 states have (on average 1.1919609316303532) internal successors, (3173), 2695 states have internal predecessors, (3173), 598 states have call successors, (598), 373 states have call predecessors, (598), 373 states have return successors, (598), 565 states have call predecessors, (598), 598 states have call successors, (598) [2024-11-13 23:40:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 4369 transitions. [2024-11-13 23:40:22,720 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 4369 transitions. Word has length 134 [2024-11-13 23:40:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:22,720 INFO L471 AbstractCegarLoop]: Abstraction has 3634 states and 4369 transitions. [2024-11-13 23:40:22,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 21 states have internal predecessors, (149), 7 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-13 23:40:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 4369 transitions. [2024-11-13 23:40:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:40:22,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:22,725 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:22,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 23:40:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 23:40:22,930 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:40:22,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash -137440141, now seen corresponding path program 1 times [2024-11-13 23:40:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953509572] [2024-11-13 23:40:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:22,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 23:40:23,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953509572] [2024-11-13 23:40:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953509572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:40:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852746418] [2024-11-13 23:40:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:40:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:23,310 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:40:23,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 23:40:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:23,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 23:40:23,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 23:40:24,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:40:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 23:40:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852746418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:40:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307998023] [2024-11-13 23:40:25,940 INFO L159 IcfgInterpreter]: Started Sifa with 77 locations of interest [2024-11-13 23:40:25,940 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:40:25,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:40:25,940 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:40:25,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:40:33,779 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 72 for LOIs [2024-11-13 23:40:33,954 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:40:33,955 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 10 for LOIs [2024-11-13 23:40:33,966 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 144 for LOIs [2024-11-13 23:40:34,459 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 74 for LOIs [2024-11-13 23:40:34,514 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 16 for LOIs [2024-11-13 23:40:34,520 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:40:49,339 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '178718#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_13| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_13| 0) (<= 0 (+ ~active_side_History_0~0 128)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_24| Int) (|v_ULTIMATE.start_check_#t~ret16#1_26| Int)) (and (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_35| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_29| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret15#1_35| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_35|) (<= |v_ULTIMATE.start_check_#t~ret15#1_35| 1) (= |v_ULTIMATE.start_check_~tmp___7~0#1_29| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_26| 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_24| 0))) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-13 23:40:49,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:40:49,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:40:49,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 17] total 33 [2024-11-13 23:40:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109114432] [2024-11-13 23:40:49,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:40:49,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 23:40:49,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:49,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 23:40:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=7775, Unknown=0, NotChecked=0, Total=8372 [2024-11-13 23:40:49,343 INFO L87 Difference]: Start difference. First operand 3634 states and 4369 transitions. Second operand has 33 states, 33 states have (on average 6.242424242424242) internal successors, (206), 32 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-13 23:40:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:57,739 INFO L93 Difference]: Finished difference Result 10842 states and 13143 transitions. [2024-11-13 23:40:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 23:40:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.242424242424242) internal successors, (206), 32 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) Word has length 143 [2024-11-13 23:40:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:57,777 INFO L225 Difference]: With dead ends: 10842 [2024-11-13 23:40:57,777 INFO L226 Difference]: Without dead ends: 7425 [2024-11-13 23:40:57,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 354 SyntacticMatches, 7 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9286 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2238, Invalid=21018, Unknown=0, NotChecked=0, Total=23256 [2024-11-13 23:40:57,791 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 2727 mSDsluCounter, 6082 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 1000 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 6562 SdHoareTripleChecker+Invalid, 5437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1000 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:57,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 6562 Invalid, 5437 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1000 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-13 23:40:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7425 states. [2024-11-13 23:40:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7425 to 7023. [2024-11-13 23:40:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 5156 states have (on average 1.186966640806827) internal successors, (6120), 5217 states have internal predecessors, (6120), 1147 states have call successors, (1147), 719 states have call predecessors, (1147), 719 states have return successors, (1147), 1086 states have call predecessors, (1147), 1147 states have call successors, (1147) [2024-11-13 23:40:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 8414 transitions. [2024-11-13 23:40:58,817 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 8414 transitions. Word has length 143 [2024-11-13 23:40:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:58,817 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 8414 transitions. [2024-11-13 23:40:58,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.242424242424242) internal successors, (206), 32 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-13 23:40:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 8414 transitions. [2024-11-13 23:40:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 23:40:58,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:58,827 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:58,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 23:40:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 23:40:59,028 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:40:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -901470125, now seen corresponding path program 1 times [2024-11-13 23:40:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742103074] [2024-11-13 23:40:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 23:40:59,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742103074] [2024-11-13 23:40:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742103074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:40:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72540223] [2024-11-13 23:40:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:59,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:40:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:59,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:40:59,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 23:41:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:00,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 23:41:00,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:41:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 23:41:00,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:41:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 23:41:00,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72540223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:41:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [694222338] [2024-11-13 23:41:00,715 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-13 23:41:00,715 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:41:00,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:41:00,715 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:41:00,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:41:14,862 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-13 23:41:14,876 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:41:14,877 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 44 for LOIs [2024-11-13 23:41:14,922 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 146 for LOIs [2024-11-13 23:41:15,431 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 76 for LOIs [2024-11-13 23:41:15,492 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 20 for LOIs [2024-11-13 23:41:15,498 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:41:30,581 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '204223#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_24| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret16#1_35| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_32| Int)) (and (= |v_ULTIMATE.start_check_~tmp___8~0#1_32| 0) (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_47| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_39| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_47| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_47|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_47| 0)) (= |v_ULTIMATE.start_check_~tmp___7~0#1_39| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_35| 0))) (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_24| 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-13 23:41:30,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:41:30,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:41:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-13 23:41:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371090547] [2024-11-13 23:41:30,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:41:30,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 23:41:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:41:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 23:41:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=6731, Unknown=0, NotChecked=0, Total=7140 [2024-11-13 23:41:30,584 INFO L87 Difference]: Start difference. First operand 7023 states and 8414 transitions. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 22 states have internal predecessors, (208), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-13 23:41:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:41:37,014 INFO L93 Difference]: Finished difference Result 17486 states and 20860 transitions. [2024-11-13 23:41:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-13 23:41:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 22 states have internal predecessors, (208), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) Word has length 143 [2024-11-13 23:41:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:41:37,078 INFO L225 Difference]: With dead ends: 17486 [2024-11-13 23:41:37,078 INFO L226 Difference]: Without dead ends: 12732 [2024-11-13 23:41:37,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 376 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8028 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1511, Invalid=20541, Unknown=0, NotChecked=0, Total=22052 [2024-11-13 23:41:37,099 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1833 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1833 SdHoareTripleChecker+Valid, 4818 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:41:37,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1833 Valid, 4818 Invalid, 3457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 23:41:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12732 states. [2024-11-13 23:41:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12732 to 8101. [2024-11-13 23:41:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8101 states, 5965 states have (on average 1.1869237217099748) internal successors, (7080), 6036 states have internal predecessors, (7080), 1304 states have call successors, (1304), 831 states have call predecessors, (1304), 831 states have return successors, (1304), 1233 states have call predecessors, (1304), 1304 states have call successors, (1304) [2024-11-13 23:41:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8101 states to 8101 states and 9688 transitions. [2024-11-13 23:41:38,496 INFO L78 Accepts]: Start accepts. Automaton has 8101 states and 9688 transitions. Word has length 143 [2024-11-13 23:41:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:41:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 8101 states and 9688 transitions. [2024-11-13 23:41:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 22 states have internal predecessors, (208), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-13 23:41:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 9688 transitions. [2024-11-13 23:41:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 23:41:38,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:41:38,506 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:41:38,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 23:41:38,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 23:41:38,711 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:41:38,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:41:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1335972739, now seen corresponding path program 1 times [2024-11-13 23:41:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:41:38,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090928361] [2024-11-13 23:41:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:41:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:41:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 23:41:38,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:41:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090928361] [2024-11-13 23:41:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090928361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:41:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:41:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:41:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236102472] [2024-11-13 23:41:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:41:38,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:41:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:41:38,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:41:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:41:38,897 INFO L87 Difference]: Start difference. First operand 8101 states and 9688 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:41:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:41:41,307 INFO L93 Difference]: Finished difference Result 22758 states and 27268 transitions. [2024-11-13 23:41:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:41:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2024-11-13 23:41:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:41:41,387 INFO L225 Difference]: With dead ends: 22758 [2024-11-13 23:41:41,387 INFO L226 Difference]: Without dead ends: 15923 [2024-11-13 23:41:41,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:41:41,405 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 192 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:41:41,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1875 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:41:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-11-13 23:41:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 12436. [2024-11-13 23:41:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12436 states, 9100 states have (on average 1.180879120879121) internal successors, (10746), 9213 states have internal predecessors, (10746), 2056 states have call successors, (2056), 1279 states have call predecessors, (2056), 1279 states have return successors, (2056), 1943 states have call predecessors, (2056), 2056 states have call successors, (2056) [2024-11-13 23:41:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12436 states to 12436 states and 14858 transitions. [2024-11-13 23:41:43,158 INFO L78 Accepts]: Start accepts. Automaton has 12436 states and 14858 transitions. Word has length 144 [2024-11-13 23:41:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:41:43,159 INFO L471 AbstractCegarLoop]: Abstraction has 12436 states and 14858 transitions. [2024-11-13 23:41:43,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 23:41:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12436 states and 14858 transitions. [2024-11-13 23:41:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 23:41:43,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:41:43,172 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:41:43,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 23:41:43,172 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:41:43,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:41:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash 712262968, now seen corresponding path program 1 times [2024-11-13 23:41:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:41:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046227063] [2024-11-13 23:41:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:41:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:41:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-13 23:41:44,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:41:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046227063] [2024-11-13 23:41:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046227063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:41:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114026492] [2024-11-13 23:41:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:41:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:41:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:41:44,115 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:41:44,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 23:41:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:41:44,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 23:41:44,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:41:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 23:41:44,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:41:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 23:41:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114026492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:41:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897076742] [2024-11-13 23:41:45,666 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-13 23:41:45,666 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:41:45,666 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:41:45,667 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:41:45,667 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:41:56,067 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-13 23:41:56,080 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:41:56,081 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 44 for LOIs [2024-11-13 23:41:56,125 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 146 for LOIs [2024-11-13 23:41:56,617 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 76 for LOIs [2024-11-13 23:41:56,674 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 20 for LOIs [2024-11-13 23:41:56,680 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:42:12,378 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '288532#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_33| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_39| Int) (|v_ULTIMATE.start_check_#t~ret16#1_43| Int)) (and (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_39| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_58| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_48| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_58| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_58| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_58|) (= |v_ULTIMATE.start_check_~tmp___7~0#1_48| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_43| 0))) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_33| 0) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-13 23:42:12,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:42:12,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:42:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 27 [2024-11-13 23:42:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160071491] [2024-11-13 23:42:12,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:42:12,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 23:42:12,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:12,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 23:42:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=7243, Unknown=0, NotChecked=0, Total=7656 [2024-11-13 23:42:12,381 INFO L87 Difference]: Start difference. First operand 12436 states and 14858 transitions. Second operand has 27 states, 27 states have (on average 7.148148148148148) internal successors, (193), 26 states have internal predecessors, (193), 9 states have call successors, (44), 5 states have call predecessors, (44), 7 states have return successors, (43), 10 states have call predecessors, (43), 9 states have call successors, (43) [2024-11-13 23:42:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:17,752 INFO L93 Difference]: Finished difference Result 24569 states and 29285 transitions. [2024-11-13 23:42:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 23:42:17,753 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.148148148148148) internal successors, (193), 26 states have internal predecessors, (193), 9 states have call successors, (44), 5 states have call predecessors, (44), 7 states have return successors, (43), 10 states have call predecessors, (43), 9 states have call successors, (43) Word has length 145 [2024-11-13 23:42:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:17,816 INFO L225 Difference]: With dead ends: 24569 [2024-11-13 23:42:17,816 INFO L226 Difference]: Without dead ends: 13693 [2024-11-13 23:42:17,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 355 SyntacticMatches, 9 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=772, Invalid=11884, Unknown=0, NotChecked=0, Total=12656 [2024-11-13 23:42:17,840 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1533 mSDsluCounter, 4141 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:17,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 4555 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 23:42:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13693 states. [2024-11-13 23:42:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13693 to 13162. [2024-11-13 23:42:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13162 states, 9636 states have (on average 1.1739310917393109) internal successors, (11312), 9757 states have internal predecessors, (11312), 2168 states have call successors, (2168), 1357 states have call predecessors, (2168), 1357 states have return successors, (2168), 2047 states have call predecessors, (2168), 2168 states have call successors, (2168) [2024-11-13 23:42:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13162 states to 13162 states and 15648 transitions. [2024-11-13 23:42:20,143 INFO L78 Accepts]: Start accepts. Automaton has 13162 states and 15648 transitions. Word has length 145 [2024-11-13 23:42:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:20,144 INFO L471 AbstractCegarLoop]: Abstraction has 13162 states and 15648 transitions. [2024-11-13 23:42:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.148148148148148) internal successors, (193), 26 states have internal predecessors, (193), 9 states have call successors, (44), 5 states have call predecessors, (44), 7 states have return successors, (43), 10 states have call predecessors, (43), 9 states have call successors, (43) [2024-11-13 23:42:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13162 states and 15648 transitions. [2024-11-13 23:42:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 23:42:20,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:20,149 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:20,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 23:42:20,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:20,350 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:42:20,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1459173618, now seen corresponding path program 1 times [2024-11-13 23:42:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:20,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915130603] [2024-11-13 23:42:20,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:20,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 23:42:21,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915130603] [2024-11-13 23:42:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915130603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:42:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621690748] [2024-11-13 23:42:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:21,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:42:21,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:42:21,147 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:42:21,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 23:42:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:21,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-13 23:42:21,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:42:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 23:42:22,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:42:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 23:42:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621690748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:42:24,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1067468480] [2024-11-13 23:42:24,270 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-13 23:42:24,270 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:42:24,271 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:42:24,271 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:42:24,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:42:40,802 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 19 for LOIs [2024-11-13 23:42:40,817 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:42:40,818 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2024-11-13 23:42:40,832 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 142 for LOIs [2024-11-13 23:42:41,369 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 72 for LOIs [2024-11-13 23:42:41,467 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 72 for LOIs [2024-11-13 23:42:41,626 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:42:59,100 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '341301#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_44| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_44| 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_46| Int) (|v_ULTIMATE.start_check_#t~ret16#1_51| Int)) (and (= |v_ULTIMATE.start_check_#t~ret16#1_51| 0) (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_46| 0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_58| Int) (|v_ULTIMATE.start_check_#t~ret15#1_70| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_70|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_70| 0)) (<= |v_ULTIMATE.start_check_#t~ret15#1_70| 1) (= |v_ULTIMATE.start_check_~tmp___7~0#1_58| 1))))) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-13 23:42:59,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:42:59,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:42:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 18] total 35 [2024-11-13 23:42:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270640827] [2024-11-13 23:42:59,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:42:59,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 23:42:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 23:42:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=8047, Unknown=0, NotChecked=0, Total=8556 [2024-11-13 23:42:59,103 INFO L87 Difference]: Start difference. First operand 13162 states and 15648 transitions. Second operand has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-13 23:43:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:09,059 INFO L93 Difference]: Finished difference Result 26865 states and 32083 transitions. [2024-11-13 23:43:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-13 23:43:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) Word has length 146 [2024-11-13 23:43:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:09,116 INFO L225 Difference]: With dead ends: 26865 [2024-11-13 23:43:09,116 INFO L226 Difference]: Without dead ends: 14593 [2024-11-13 23:43:09,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 363 SyntacticMatches, 10 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9850 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=1674, Invalid=23766, Unknown=0, NotChecked=0, Total=25440 [2024-11-13 23:43:09,144 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1602 mSDsluCounter, 4718 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 5106 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:09,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 5106 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 23:43:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2024-11-13 23:43:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 13056. [2024-11-13 23:43:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13056 states, 9566 states have (on average 1.1740539410411874) internal successors, (11231), 9686 states have internal predecessors, (11231), 2137 states have call successors, (2137), 1352 states have call predecessors, (2137), 1352 states have return successors, (2137), 2017 states have call predecessors, (2137), 2137 states have call successors, (2137) [2024-11-13 23:43:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13056 states to 13056 states and 15505 transitions. [2024-11-13 23:43:11,980 INFO L78 Accepts]: Start accepts. Automaton has 13056 states and 15505 transitions. Word has length 146 [2024-11-13 23:43:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:11,980 INFO L471 AbstractCegarLoop]: Abstraction has 13056 states and 15505 transitions. [2024-11-13 23:43:11,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-13 23:43:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 13056 states and 15505 transitions. [2024-11-13 23:43:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 23:43:11,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:11,984 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:11,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 23:43:12,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:12,185 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:43:12,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash -409059753, now seen corresponding path program 1 times [2024-11-13 23:43:12,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:12,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142688729] [2024-11-13 23:43:12,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-13 23:43:13,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142688729] [2024-11-13 23:43:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142688729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:43:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57876267] [2024-11-13 23:43:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:43:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:43:13,755 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:43:13,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 23:43:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:13,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-13 23:43:13,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 23:43:15,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:43:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-13 23:43:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57876267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:43:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1453928936] [2024-11-13 23:43:15,800 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-13 23:43:15,800 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:43:15,800 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:43:15,800 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:43:15,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:43:24,832 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 66 for LOIs [2024-11-13 23:43:25,083 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:43:25,084 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 17 for LOIs [2024-11-13 23:43:25,100 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 140 for LOIs [2024-11-13 23:43:25,574 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 68 for LOIs [2024-11-13 23:43:25,627 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-13 23:43:25,751 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:43:44,912 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '397133#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_53| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_53| 0) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_54| Int) (|v_ULTIMATE.start_check_#t~ret16#1_60| Int)) (and (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_#t~ret16#1_60| 0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_67| Int) (|v_ULTIMATE.start_check_#t~ret15#1_81| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_67| 1) (<= |v_ULTIMATE.start_check_#t~ret15#1_81| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_81| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_81|))) (= |v_ULTIMATE.start_check_~tmp___8~0#1_54| 0))) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-13 23:43:44,912 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:43:44,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:43:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 16] total 34 [2024-11-13 23:43:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118503126] [2024-11-13 23:43:44,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:43:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 23:43:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 23:43:44,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=8391, Unknown=0, NotChecked=0, Total=8930 [2024-11-13 23:43:44,916 INFO L87 Difference]: Start difference. First operand 13056 states and 15505 transitions. Second operand has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 33 states have internal predecessors, (215), 11 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (46), 11 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-13 23:43:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:57,326 INFO L93 Difference]: Finished difference Result 35195 states and 41854 transitions. [2024-11-13 23:43:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-11-13 23:43:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 33 states have internal predecessors, (215), 11 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (46), 11 states have call predecessors, (46), 10 states have call successors, (46) Word has length 148 [2024-11-13 23:43:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:57,385 INFO L225 Difference]: With dead ends: 35195 [2024-11-13 23:43:57,385 INFO L226 Difference]: Without dead ends: 22425 [2024-11-13 23:43:57,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 385 SyntacticMatches, 5 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20114 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=3463, Invalid=46489, Unknown=0, NotChecked=0, Total=49952 [2024-11-13 23:43:57,411 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 2304 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:57,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 3862 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 23:43:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22425 states. [2024-11-13 23:44:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22425 to 13445. [2024-11-13 23:44:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13445 states, 9878 states have (on average 1.1729094958493622) internal successors, (11586), 10000 states have internal predecessors, (11586), 2178 states have call successors, (2178), 1388 states have call predecessors, (2178), 1388 states have return successors, (2178), 2056 states have call predecessors, (2178), 2178 states have call successors, (2178) [2024-11-13 23:44:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13445 states to 13445 states and 15942 transitions. [2024-11-13 23:44:00,303 INFO L78 Accepts]: Start accepts. Automaton has 13445 states and 15942 transitions. Word has length 148 [2024-11-13 23:44:00,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:00,304 INFO L471 AbstractCegarLoop]: Abstraction has 13445 states and 15942 transitions. [2024-11-13 23:44:00,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 33 states have internal predecessors, (215), 11 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (46), 11 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-13 23:44:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13445 states and 15942 transitions. [2024-11-13 23:44:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 23:44:00,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:00,309 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:00,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 23:44:00,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:44:00,509 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:44:00,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1046860253, now seen corresponding path program 1 times [2024-11-13 23:44:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:44:00,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29357814] [2024-11-13 23:44:00,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:44:00,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:44:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:44:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 23:44:01,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:44:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29357814] [2024-11-13 23:44:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29357814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:44:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795560110] [2024-11-13 23:44:01,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:44:01,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:44:01,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:44:01,338 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:44:01,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 23:44:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:44:01,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 23:44:01,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:44:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 23:44:01,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:44:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 23:44:02,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795560110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:44:02,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378630896] [2024-11-13 23:44:02,113 INFO L159 IcfgInterpreter]: Started Sifa with 76 locations of interest [2024-11-13 23:44:02,113 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:44:02,113 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:44:02,113 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:44:02,113 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:44:07,228 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-13 23:44:07,235 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-13 23:44:10,721 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-13 23:44:10,731 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-13 23:44:11,340 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-13 23:44:11,354 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-13 23:44:11,355 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 17 for LOIs [2024-11-13 23:44:11,371 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 122 for LOIs [2024-11-13 23:44:12,073 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 49 for LOIs [2024-11-13 23:44:12,102 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-13 23:44:12,224 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:44:27,698 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '465014#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_check_~tmp~3#1_72| Int)) (and (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_58| 0) (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (not (= ~active_side_History_0~0 1)) (exists ((|v_ULTIMATE.start_check_#t~ret20#1_71| Int) (|v_ULTIMATE.start_check_~tmp___12~0#1_65| Int)) (and (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_65| Int) (|v_ULTIMATE.start_check_#t~ret19#1_75| Int)) (and (= |v_ULTIMATE.start_check_#t~ret19#1_75| 0) (= |v_ULTIMATE.start_check_~tmp___11~0#1_65| 0))) (= |v_ULTIMATE.start_check_~tmp___12~0#1_65| 1) (not (= |v_ULTIMATE.start_check_#t~ret20#1_71| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret20#1_71|) (<= |v_ULTIMATE.start_check_#t~ret20#1_71| 1) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_77| Int) (|v_ULTIMATE.start_check_#t~ret15#1_93| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_77| 0) (= |v_ULTIMATE.start_check_#t~ret15#1_93| 0))) (not (= ~side2Failed_History_1~0 0)))) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_check_~tmp~3#1_72| 1) (= ~side2_written~0 0) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-13 23:44:27,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:44:27,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:44:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-11-13 23:44:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412377477] [2024-11-13 23:44:27,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:44:27,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 23:44:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:44:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 23:44:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=6533, Unknown=0, NotChecked=0, Total=6972 [2024-11-13 23:44:27,700 INFO L87 Difference]: Start difference. First operand 13445 states and 15942 transitions. Second operand has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 20 states have internal predecessors, (216), 9 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (44), 12 states have call predecessors, (44), 9 states have call successors, (44) [2024-11-13 23:44:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:44:33,295 INFO L93 Difference]: Finished difference Result 35832 states and 42526 transitions. [2024-11-13 23:44:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 23:44:33,296 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 20 states have internal predecessors, (216), 9 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (44), 12 states have call predecessors, (44), 9 states have call successors, (44) Word has length 156 [2024-11-13 23:44:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:44:33,360 INFO L225 Difference]: With dead ends: 35832 [2024-11-13 23:44:33,360 INFO L226 Difference]: Without dead ends: 22829 [2024-11-13 23:44:33,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 395 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3829 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=677, Invalid=9829, Unknown=0, NotChecked=0, Total=10506 [2024-11-13 23:44:33,381 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 914 mSDsluCounter, 3364 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 23:44:33,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 3687 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 23:44:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22829 states. [2024-11-13 23:44:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22829 to 19833. [2024-11-13 23:44:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19833 states, 14522 states have (on average 1.1696735986778681) internal successors, (16986), 14703 states have internal predecessors, (16986), 3270 states have call successors, (3270), 2040 states have call predecessors, (3270), 2040 states have return successors, (3270), 3089 states have call predecessors, (3270), 3270 states have call successors, (3270) [2024-11-13 23:44:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19833 states to 19833 states and 23526 transitions. [2024-11-13 23:44:37,430 INFO L78 Accepts]: Start accepts. Automaton has 19833 states and 23526 transitions. Word has length 156 [2024-11-13 23:44:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:37,431 INFO L471 AbstractCegarLoop]: Abstraction has 19833 states and 23526 transitions. [2024-11-13 23:44:37,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 20 states have internal predecessors, (216), 9 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (44), 12 states have call predecessors, (44), 9 states have call successors, (44) [2024-11-13 23:44:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 19833 states and 23526 transitions. [2024-11-13 23:44:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 23:44:37,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:37,437 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:37,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 23:44:37,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 23:44:37,637 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:44:37,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:37,638 INFO L85 PathProgramCache]: Analyzing trace with hash -406136485, now seen corresponding path program 1 times [2024-11-13 23:44:37,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:44:37,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428217988] [2024-11-13 23:44:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:44:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:44:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:44:37,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:44:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:44:38,113 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:44:38,113 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:44:38,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:44:38,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 23:44:38,120 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:38,352 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:44:38,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:44:38 BoogieIcfgContainer [2024-11-13 23:44:38,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:44:38,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:44:38,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:44:38,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:44:38,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:37:35" (3/4) ... [2024-11-13 23:44:38,359 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 23:44:38,612 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-13 23:44:38,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:44:38,613 INFO L158 Benchmark]: Toolchain (without parser) took 424900.15ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 118.7MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 211.5MB. Max. memory is 16.1GB. [2024-11-13 23:44:38,613 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:44:38,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.51ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 100.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:44:38,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.75ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 97.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:44:38,616 INFO L158 Benchmark]: Boogie Preprocessor took 71.21ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:44:38,617 INFO L158 Benchmark]: RCFGBuilder took 1251.55ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 78.4MB in the end (delta: 16.2MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2024-11-13 23:44:38,617 INFO L158 Benchmark]: TraceAbstraction took 422771.67ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 77.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-13 23:44:38,617 INFO L158 Benchmark]: Witness Printer took 255.21ms. Allocated memory is still 4.6GB. Free memory was 4.4GB in the beginning and 4.3GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:44:38,619 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.36ms. Allocated memory is still 142.6MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.51ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 100.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.75ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 97.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.21ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1251.55ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 78.4MB in the end (delta: 16.2MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 422771.67ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 77.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 255.21ms. Allocated memory is still 4.6GB. Free memory was 4.4GB in the beginning and 4.3GB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * 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: 618]: 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) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) 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, 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, 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, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, 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=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE 1 [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 TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, 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=1, side1Failed_History_0=1, 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 )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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=1, side1Failed_History_0=1, 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=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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L408] COND TRUE (int )side1 == (int )nomsg [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=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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=0] [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 ; [L447] COND FALSE !(! side1Failed) [L450] COND TRUE ! side2Failed [L451] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L58] COND FALSE !(!cond) [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L486] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L486] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L502] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L502] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L504] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L504] 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=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L616] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, i2=1, manual_selection_History_0=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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=0] [L582] COND TRUE 1 [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 TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, next_state=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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] CALL, EXPR read_active_side_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=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_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=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] RET, EXPR read_active_side_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=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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 ; [L447] COND FALSE !(! side1Failed) [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=4, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 422.5s, OverallIterations: 35, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 68.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16132 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16062 mSDsluCounter, 66746 SdHoareTripleChecker+Invalid, 20.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57049 mSDsCounter, 4603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23506 IncrementalHoareTripleChecker+Invalid, 28109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4603 mSolverCounterUnsat, 9697 mSDtfsCounter, 23506 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 3554 SyntacticMatches, 62 SemanticMatches, 1346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66097 ImplicationChecksByTransitivity, 212.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19833occurred in iteration=34, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 25139 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 4725 NumberOfCodeBlocks, 4725 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5789 ConstructedInterpolants, 0 QuantifiedInterpolants, 21223 SizeOfPredicates, 79 NumberOfNonLiveVariables, 7966 ConjunctsInSsa, 408 ConjunctsInUnsatCore, 59 InterpolantComputations, 25 PerfectInterpolantSequences, 2901/3319 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! [2024-11-13 23:44:38,845 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-13 23:44:38,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84918a1b-5a51-4d3f-aae7-3ef113f5920b/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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