./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/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_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/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_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/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 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:34:28,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:34:28,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:34:28,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:34:28,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:34:29,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:34:29,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:34:29,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:34:29,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:34:29,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:34:29,042 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:34:29,042 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:34:29,043 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:34:29,044 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:34:29,045 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:34:29,045 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:34:29,045 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:34:29,045 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:34:29,046 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:34:29,046 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:34:29,047 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:34:29,047 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:34:29,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:34:29,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:34:29,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:34:29,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:34:29,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:34:29,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:34:29,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:34:29,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:34:29,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:34:29,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:34:29,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:34:29,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:34:29,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:34:29,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:34:29,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:34:29,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:34:29,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:34:29,051 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:34:29,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:34:29,051 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_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/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 -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2024-11-14 03:34:29,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:34:29,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:34:29,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:34:29,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:34:29,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:34:29,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c Unable to find full path for "g++" [2024-11-14 03:34:31,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:34:32,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:34:32,489 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-14 03:34:32,513 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/data/6f0725a20/b925623e47be447a856fbb7b91e4a683/FLAG42e848c1b [2024-11-14 03:34:32,545 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/data/6f0725a20/b925623e47be447a856fbb7b91e4a683 [2024-11-14 03:34:32,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:34:32,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:34:32,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:34:32,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:34:32,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:34:32,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:34:32" (1/1) ... [2024-11-14 03:34:32,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5a77dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:32, skipping insertion in model container [2024-11-14 03:34:32,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:34:32" (1/1) ... [2024-11-14 03:34:32,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:34:33,022 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_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2024-11-14 03:34:33,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:34:33,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:34:33,122 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_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2024-11-14 03:34:33,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:34:33,142 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:34:33,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33 WrapperNode [2024-11-14 03:34:33,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:34:33,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:34:33,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:34:33,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:34:33,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,220 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 509 [2024-11-14 03:34:33,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:34:33,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:34:33,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:34:33,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:34:33,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:34:33,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:34:33,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:34:33,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:34:33,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (1/1) ... [2024-11-14 03:34:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:34:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:34:33,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:34:33,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:34:33,376 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-14 03:34:33,376 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-14 03:34:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:34:33,377 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-14 03:34:33,377 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-14 03:34:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-14 03:34:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-14 03:34:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-14 03:34:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-14 03:34:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:34:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:34:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:34:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-14 03:34:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-14 03:34:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:34:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:34:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-14 03:34:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-14 03:34:33,556 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:34:33,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:34:34,579 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-14 03:34:34,581 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:34:34,814 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:34:34,815 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:34:34,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:34:34 BoogieIcfgContainer [2024-11-14 03:34:34,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:34:34,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:34:34,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:34:34,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:34:34,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:34:32" (1/3) ... [2024-11-14 03:34:34,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a053659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:34:34, skipping insertion in model container [2024-11-14 03:34:34,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:34:33" (2/3) ... [2024-11-14 03:34:34,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a053659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:34:34, skipping insertion in model container [2024-11-14 03:34:34,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:34:34" (3/3) ... [2024-11-14 03:34:34,829 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-11-14 03:34:34,848 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:34:34,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c that has 8 procedures, 150 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:34:34,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:34:34,950 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;@421ad8a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:34:34,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:34:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 111 states have internal predecessors, (169), 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-14 03:34:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:34:34,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:34,971 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-14 03:34:34,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:34,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1444549694, now seen corresponding path program 1 times [2024-11-14 03:34:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378447412] [2024-11-14 03:34:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:36,057 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-14 03:34:36,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378447412] [2024-11-14 03:34:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378447412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:34:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510042925] [2024-11-14 03:34:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:36,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:34:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:34:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:34:36,104 INFO L87 Difference]: Start difference. First operand has 150 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 111 states have internal predecessors, (169), 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-14 03:34:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:36,348 INFO L93 Difference]: Finished difference Result 301 states and 489 transitions. [2024-11-14 03:34:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:34:36,353 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-14 03:34:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:36,366 INFO L225 Difference]: With dead ends: 301 [2024-11-14 03:34:36,366 INFO L226 Difference]: Without dead ends: 153 [2024-11-14 03:34:36,372 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-14 03:34:36,379 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 3 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:34:36,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 638 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:34:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-14 03:34:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-14 03:34:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 113 states have internal predecessors, (170), 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-14 03:34:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 232 transitions. [2024-11-14 03:34:36,467 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 232 transitions. Word has length 19 [2024-11-14 03:34:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:36,469 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 232 transitions. [2024-11-14 03:34:36,469 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-14 03:34:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 232 transitions. [2024-11-14 03:34:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:34:36,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:36,474 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-14 03:34:36,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:34:36,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:36,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash -933848562, now seen corresponding path program 1 times [2024-11-14 03:34:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858582672] [2024-11-14 03:34:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:36,913 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-14 03:34:36,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:36,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858582672] [2024-11-14 03:34:36,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858582672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:36,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:36,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:34:36,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710958738] [2024-11-14 03:34:36,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:36,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:34:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:34:36,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:34:36,922 INFO L87 Difference]: Start difference. First operand 153 states and 232 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-14 03:34:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:37,281 INFO L93 Difference]: Finished difference Result 339 states and 514 transitions. [2024-11-14 03:34:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:34:37,282 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-14 03:34:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:37,285 INFO L225 Difference]: With dead ends: 339 [2024-11-14 03:34:37,285 INFO L226 Difference]: Without dead ends: 189 [2024-11-14 03:34:37,287 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-14 03:34:37,288 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 325 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 575 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.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:34:37,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 575 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:34:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-14 03:34:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2024-11-14 03:34:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 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-14 03:34:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2024-11-14 03:34:37,322 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 30 [2024-11-14 03:34:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:37,323 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2024-11-14 03:34:37,323 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-14 03:34:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2024-11-14 03:34:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:34:37,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:37,325 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-14 03:34:37,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:34:37,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:37,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash 666509892, now seen corresponding path program 1 times [2024-11-14 03:34:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119796534] [2024-11-14 03:34:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:37,681 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-14 03:34:37,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119796534] [2024-11-14 03:34:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119796534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:37,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:34:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516420178] [2024-11-14 03:34:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:37,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:34:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:34:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:34:37,683 INFO L87 Difference]: Start difference. First operand 187 states and 282 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-14 03:34:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:37,989 INFO L93 Difference]: Finished difference Result 338 states and 511 transitions. [2024-11-14 03:34:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:34:37,993 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-14 03:34:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:37,995 INFO L225 Difference]: With dead ends: 338 [2024-11-14 03:34:37,996 INFO L226 Difference]: Without dead ends: 188 [2024-11-14 03:34:37,997 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-14 03:34:37,998 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 320 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 578 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-14 03:34:37,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 578 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:34:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-14 03:34:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2024-11-14 03:34:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.5) internal successors, (213), 142 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-14 03:34:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2024-11-14 03:34:38,030 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 31 [2024-11-14 03:34:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:38,030 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2024-11-14 03:34:38,031 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-14 03:34:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2024-11-14 03:34:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:34:38,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:38,032 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-14 03:34:38,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:34:38,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:38,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash 413829262, now seen corresponding path program 1 times [2024-11-14 03:34:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476623622] [2024-11-14 03:34:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:38,431 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-14 03:34:38,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476623622] [2024-11-14 03:34:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476623622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:34:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123669482] [2024-11-14 03:34:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:34:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:34:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:34:38,434 INFO L87 Difference]: Start difference. First operand 187 states and 281 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-14 03:34:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:38,559 INFO L93 Difference]: Finished difference Result 342 states and 516 transitions. [2024-11-14 03:34:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:34:38,559 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-14 03:34:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:38,562 INFO L225 Difference]: With dead ends: 342 [2024-11-14 03:34:38,562 INFO L226 Difference]: Without dead ends: 192 [2024-11-14 03:34:38,564 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-14 03:34:38,565 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 4 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 650 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-14 03:34:38,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 650 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:34:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-14 03:34:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-14 03:34:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 146 states have internal predecessors, (217), 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-14 03:34:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2024-11-14 03:34:38,596 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 285 transitions. Word has length 33 [2024-11-14 03:34:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:38,597 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 285 transitions. [2024-11-14 03:34:38,597 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-14 03:34:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2024-11-14 03:34:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:34:38,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:38,599 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-14 03:34:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:34:38,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:38,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -95561516, now seen corresponding path program 1 times [2024-11-14 03:34:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535837814] [2024-11-14 03:34:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:39,044 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-14 03:34:39,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535837814] [2024-11-14 03:34:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535837814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:39,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:34:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416367522] [2024-11-14 03:34:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:34:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:34:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:34:39,049 INFO L87 Difference]: Start difference. First operand 192 states and 285 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-14 03:34:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:39,209 INFO L93 Difference]: Finished difference Result 352 states and 527 transitions. [2024-11-14 03:34:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:34:39,211 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-14 03:34:39,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:39,214 INFO L225 Difference]: With dead ends: 352 [2024-11-14 03:34:39,216 INFO L226 Difference]: Without dead ends: 197 [2024-11-14 03:34:39,217 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-14 03:34:39,218 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 636 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-14 03:34:39,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 636 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:34:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-14 03:34:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-14 03:34:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 150 states have (on average 1.4733333333333334) internal successors, (221), 150 states have internal predecessors, (221), 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-14 03:34:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2024-11-14 03:34:39,267 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 41 [2024-11-14 03:34:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2024-11-14 03:34:39,268 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-14 03:34:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2024-11-14 03:34:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 03:34:39,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:39,270 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-14 03:34:39,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:34:39,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:39,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1029949886, now seen corresponding path program 1 times [2024-11-14 03:34:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063869350] [2024-11-14 03:34:39,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:39,642 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-14 03:34:39,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063869350] [2024-11-14 03:34:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063869350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:34:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327112116] [2024-11-14 03:34:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:34:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:34:39,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:34:39,649 INFO L87 Difference]: Start difference. First operand 197 states and 289 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-14 03:34:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:39,791 INFO L93 Difference]: Finished difference Result 361 states and 531 transitions. [2024-11-14 03:34:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:34:39,793 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-14 03:34:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:39,795 INFO L225 Difference]: With dead ends: 361 [2024-11-14 03:34:39,797 INFO L226 Difference]: Without dead ends: 201 [2024-11-14 03:34:39,799 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-14 03:34:39,800 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 3 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 646 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-14 03:34:39,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 646 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:34:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-14 03:34:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-14 03:34:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 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-14 03:34:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2024-11-14 03:34:39,843 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 49 [2024-11-14 03:34:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:39,843 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2024-11-14 03:34:39,843 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-14 03:34:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2024-11-14 03:34:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 03:34:39,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:39,845 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-14 03:34:39,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:34:39,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash -868558107, now seen corresponding path program 1 times [2024-11-14 03:34:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969650659] [2024-11-14 03:34:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:40,147 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-14 03:34:40,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969650659] [2024-11-14 03:34:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969650659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:40,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:40,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:34:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711923325] [2024-11-14 03:34:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:40,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:34:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:40,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:34:40,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:34:40,149 INFO L87 Difference]: Start difference. First operand 201 states and 292 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-14 03:34:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:40,295 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2024-11-14 03:34:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:34:40,296 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-14 03:34:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:40,298 INFO L225 Difference]: With dead ends: 370 [2024-11-14 03:34:40,298 INFO L226 Difference]: Without dead ends: 206 [2024-11-14 03:34:40,299 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-14 03:34:40,302 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 636 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-14 03:34:40,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 636 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:34:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-14 03:34:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-14 03:34:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 157 states have internal predecessors, (228), 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-14 03:34:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2024-11-14 03:34:40,331 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 49 [2024-11-14 03:34:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:40,333 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2024-11-14 03:34:40,333 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-14 03:34:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2024-11-14 03:34:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-14 03:34:40,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:40,339 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-14 03:34:40,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:34:40,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:40,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -274681243, now seen corresponding path program 1 times [2024-11-14 03:34:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:40,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196252349] [2024-11-14 03:34:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:40,680 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-14 03:34:40,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196252349] [2024-11-14 03:34:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196252349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:40,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:34:40,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:34:40,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990217460] [2024-11-14 03:34:40,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:40,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:34:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:40,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:34:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:34:40,685 INFO L87 Difference]: Start difference. First operand 206 states and 296 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-14 03:34:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:40,835 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2024-11-14 03:34:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:34:40,836 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-14 03:34:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:40,839 INFO L225 Difference]: With dead ends: 381 [2024-11-14 03:34:40,839 INFO L226 Difference]: Without dead ends: 212 [2024-11-14 03:34:40,844 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-14 03:34:40,845 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 648 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-14 03:34:40,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 648 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:34:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-14 03:34:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-14 03:34:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 162 states have internal predecessors, (233), 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-14 03:34:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2024-11-14 03:34:40,886 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 57 [2024-11-14 03:34:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:40,888 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2024-11-14 03:34:40,888 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-14 03:34:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2024-11-14 03:34:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 03:34:40,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:40,892 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-14 03:34:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:34:40,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:40,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1672917955, now seen corresponding path program 1 times [2024-11-14 03:34:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:40,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786447140] [2024-11-14 03:34:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:42,047 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-14 03:34:42,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786447140] [2024-11-14 03:34:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786447140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:34:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307948234] [2024-11-14 03:34:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:42,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:34:42,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:34:42,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:34:42,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:34:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:42,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:34:42,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:34:42,595 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-14 03:34:42,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:34:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307948234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:34:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:34:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-11-14 03:34:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486236538] [2024-11-14 03:34:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:34:42,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:34:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:34:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:34:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:34:42,601 INFO L87 Difference]: Start difference. First operand 212 states and 301 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-14 03:34:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:34:43,017 INFO L93 Difference]: Finished difference Result 601 states and 839 transitions. [2024-11-14 03:34:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:34:43,018 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-14 03:34:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:34:43,026 INFO L225 Difference]: With dead ends: 601 [2024-11-14 03:34:43,026 INFO L226 Difference]: Without dead ends: 400 [2024-11-14 03:34:43,028 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-14 03:34:43,032 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 217 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1016 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.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:34:43,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1016 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:34:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-14 03:34:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2024-11-14 03:34:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 300 states have (on average 1.42) internal successors, (426), 301 states have internal predecessors, (426), 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-14 03:34:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 556 transitions. [2024-11-14 03:34:43,089 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 556 transitions. Word has length 60 [2024-11-14 03:34:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:34:43,089 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 556 transitions. [2024-11-14 03:34:43,089 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-14 03:34:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 556 transitions. [2024-11-14 03:34:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 03:34:43,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:34:43,092 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-14 03:34:43,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:34:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:34:43,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:34:43,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:34:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1913291170, now seen corresponding path program 1 times [2024-11-14 03:34:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:34:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64404747] [2024-11-14 03:34:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:34:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:44,358 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-14 03:34:44,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:34:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64404747] [2024-11-14 03:34:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64404747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:34:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034350336] [2024-11-14 03:34:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:34:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:34:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:34:44,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:34:44,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:34:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:34:44,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:34:44,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:34:45,244 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-14 03:34:45,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:34:45,452 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-14 03:34:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034350336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:34:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72305171] [2024-11-14 03:34:45,477 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2024-11-14 03:34:45,477 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:34:45,480 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:34:45,486 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:34:45,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:35:00,427 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-14 03:35:00,434 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-14 03:35:00,435 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 80 for LOIs [2024-11-14 03:35:00,672 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 131 for LOIs [2024-11-14 03:35:01,813 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 106 for LOIs [2024-11-14 03:35:02,518 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-14 03:35:02,642 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:35:29,631 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7762#(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 1) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-14 03:35:29,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:35:29,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:35:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-14 03:35:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862143093] [2024-11-14 03:35:29,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:35:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:35:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:35:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=3440, Unknown=2, NotChecked=0, Total=3782 [2024-11-14 03:35:29,637 INFO L87 Difference]: Start difference. First operand 396 states and 556 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-14 03:35:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:30,484 INFO L93 Difference]: Finished difference Result 1014 states and 1405 transitions. [2024-11-14 03:35:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:35:30,485 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-14 03:35:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:30,491 INFO L225 Difference]: With dead ends: 1014 [2024-11-14 03:35:30,491 INFO L226 Difference]: Without dead ends: 678 [2024-11-14 03:35:30,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=404, Invalid=4706, Unknown=2, NotChecked=0, Total=5112 [2024-11-14 03:35:30,496 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 263 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 3582 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:30,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 3582 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:35:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-14 03:35:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 515. [2024-11-14 03:35:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 385 states have (on average 1.412987012987013) internal successors, (544), 388 states have internal predecessors, (544), 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-14 03:35:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 720 transitions. [2024-11-14 03:35:30,567 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 720 transitions. Word has length 62 [2024-11-14 03:35:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:30,568 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 720 transitions. [2024-11-14 03:35:30,568 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-14 03:35:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 720 transitions. [2024-11-14 03:35:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 03:35:30,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:30,569 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-14 03:35:30,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:35:30,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:30,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:30,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:30,775 INFO L85 PathProgramCache]: Analyzing trace with hash 896996213, now seen corresponding path program 1 times [2024-11-14 03:35:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556011327] [2024-11-14 03:35:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:30,989 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-14 03:35:30,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556011327] [2024-11-14 03:35:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556011327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:35:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594317455] [2024-11-14 03:35:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:35:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:35:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:35:30,991 INFO L87 Difference]: Start difference. First operand 515 states and 720 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-14 03:35:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:31,101 INFO L93 Difference]: Finished difference Result 971 states and 1357 transitions. [2024-11-14 03:35:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:35:31,102 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-14 03:35:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:31,105 INFO L225 Difference]: With dead ends: 971 [2024-11-14 03:35:31,106 INFO L226 Difference]: Without dead ends: 527 [2024-11-14 03:35:31,109 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-14 03:35:31,109 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 3 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 646 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-14 03:35:31,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 646 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-14 03:35:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-11-14 03:35:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 394 states have (on average 1.4035532994923858) internal successors, (553), 397 states have internal predecessors, (553), 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-14 03:35:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 729 transitions. [2024-11-14 03:35:31,157 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 729 transitions. Word has length 66 [2024-11-14 03:35:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:31,158 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 729 transitions. [2024-11-14 03:35:31,158 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-14 03:35:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 729 transitions. [2024-11-14 03:35:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 03:35:31,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:31,160 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-14 03:35:31,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:35:31,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:31,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1401464673, now seen corresponding path program 1 times [2024-11-14 03:35:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:31,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164045262] [2024-11-14 03:35:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:31,876 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-14 03:35:31,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164045262] [2024-11-14 03:35:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164045262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:35:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202189595] [2024-11-14 03:35:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:31,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:35:31,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:35:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:35:31,879 INFO L87 Difference]: Start difference. First operand 527 states and 729 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-14 03:35:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:32,625 INFO L93 Difference]: Finished difference Result 1120 states and 1521 transitions. [2024-11-14 03:35:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:35:32,626 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-14 03:35:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:32,632 INFO L225 Difference]: With dead ends: 1120 [2024-11-14 03:35:32,632 INFO L226 Difference]: Without dead ends: 660 [2024-11-14 03:35:32,634 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-14 03:35:32,635 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 495 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:32,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1176 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:35:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-14 03:35:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 648. [2024-11-14 03:35:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 480 states have (on average 1.3625) internal successors, (654), 483 states have internal predecessors, (654), 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-14 03:35:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 872 transitions. [2024-11-14 03:35:32,701 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 872 transitions. Word has length 71 [2024-11-14 03:35:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:32,702 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 872 transitions. [2024-11-14 03:35:32,702 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-14 03:35:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 872 transitions. [2024-11-14 03:35:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 03:35:32,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:32,704 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-14 03:35:32,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:35:32,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:32,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash -722680063, now seen corresponding path program 1 times [2024-11-14 03:35:32,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:32,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714890150] [2024-11-14 03:35:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:32,814 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-14 03:35:32,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:32,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714890150] [2024-11-14 03:35:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714890150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:32,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:35:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822162504] [2024-11-14 03:35:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:32,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:35:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:35:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:35:32,816 INFO L87 Difference]: Start difference. First operand 648 states and 872 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-14 03:35:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:33,026 INFO L93 Difference]: Finished difference Result 1579 states and 2125 transitions. [2024-11-14 03:35:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:35:33,026 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-14 03:35:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:33,035 INFO L225 Difference]: With dead ends: 1579 [2024-11-14 03:35:33,036 INFO L226 Difference]: Without dead ends: 1142 [2024-11-14 03:35:33,038 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-14 03:35:33,039 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 188 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 956 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-14 03:35:33,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 956 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-14 03:35:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1057. [2024-11-14 03:35:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 782 states have (on average 1.3516624040920715) internal successors, (1057), 788 states have internal predecessors, (1057), 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-14 03:35:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1413 transitions. [2024-11-14 03:35:33,157 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1413 transitions. Word has length 71 [2024-11-14 03:35:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1413 transitions. [2024-11-14 03:35:33,158 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-14 03:35:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1413 transitions. [2024-11-14 03:35:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 03:35:33,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:33,159 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-14 03:35:33,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:35:33,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:33,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1174449427, now seen corresponding path program 1 times [2024-11-14 03:35:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864695345] [2024-11-14 03:35:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:33,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:33,457 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-14 03:35:33,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:33,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864695345] [2024-11-14 03:35:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864695345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:35:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696247480] [2024-11-14 03:35:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:35:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:33,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:35:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:35:33,459 INFO L87 Difference]: Start difference. First operand 1057 states and 1413 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 03:35:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:33,732 INFO L93 Difference]: Finished difference Result 1409 states and 1964 transitions. [2024-11-14 03:35:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:35:33,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-14 03:35:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:33,744 INFO L225 Difference]: With dead ends: 1409 [2024-11-14 03:35:33,745 INFO L226 Difference]: Without dead ends: 1407 [2024-11-14 03:35:33,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:35:33,746 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 124 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:33,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1785 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-11-14 03:35:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1064. [2024-11-14 03:35:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 785 states have (on average 1.3503184713375795) internal successors, (1060), 793 states have internal predecessors, (1060), 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-14 03:35:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1420 transitions. [2024-11-14 03:35:33,875 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1420 transitions. Word has length 73 [2024-11-14 03:35:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:33,876 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1420 transitions. [2024-11-14 03:35:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 03:35:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1420 transitions. [2024-11-14 03:35:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 03:35:33,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:33,879 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-14 03:35:33,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:35:33,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1910101910, now seen corresponding path program 1 times [2024-11-14 03:35:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592074861] [2024-11-14 03:35:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:34,451 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-14 03:35:34,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592074861] [2024-11-14 03:35:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592074861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:35:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883955924] [2024-11-14 03:35:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:34,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:35:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:35:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:35:34,453 INFO L87 Difference]: Start difference. First operand 1064 states and 1420 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-14 03:35:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:35,286 INFO L93 Difference]: Finished difference Result 2502 states and 3328 transitions. [2024-11-14 03:35:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:35:35,287 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-14 03:35:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:35,301 INFO L225 Difference]: With dead ends: 2502 [2024-11-14 03:35:35,301 INFO L226 Difference]: Without dead ends: 1700 [2024-11-14 03:35:35,304 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-14 03:35:35,305 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 405 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:35,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1887 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:35:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2024-11-14 03:35:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1651. [2024-11-14 03:35:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1207 states have (on average 1.3347141673570837) internal successors, (1611), 1220 states have internal predecessors, (1611), 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-14 03:35:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2187 transitions. [2024-11-14 03:35:35,534 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2187 transitions. Word has length 73 [2024-11-14 03:35:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:35,535 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2187 transitions. [2024-11-14 03:35:35,535 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-14 03:35:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2187 transitions. [2024-11-14 03:35:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-14 03:35:35,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:35,538 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-14 03:35:35,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:35:35,538 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:35,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1542486590, now seen corresponding path program 1 times [2024-11-14 03:35:35,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:35,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14607496] [2024-11-14 03:35:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 03:35:35,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:35,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14607496] [2024-11-14 03:35:35,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14607496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:35,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:35,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:35:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344294271] [2024-11-14 03:35:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:35,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:35:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:35:35,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:35:35,751 INFO L87 Difference]: Start difference. First operand 1651 states and 2187 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 03:35:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:36,022 INFO L93 Difference]: Finished difference Result 2858 states and 3800 transitions. [2024-11-14 03:35:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:35:36,023 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-14 03:35:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:36,034 INFO L225 Difference]: With dead ends: 2858 [2024-11-14 03:35:36,034 INFO L226 Difference]: Without dead ends: 1629 [2024-11-14 03:35:36,037 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-14 03:35:36,038 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:36,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 638 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:35:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-14 03:35:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2024-11-14 03:35:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1196 states have (on average 1.310200668896321) internal successors, (1567), 1209 states have internal predecessors, (1567), 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-14 03:35:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2121 transitions. [2024-11-14 03:35:36,255 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2121 transitions. Word has length 76 [2024-11-14 03:35:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:36,256 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2121 transitions. [2024-11-14 03:35:36,256 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 03:35:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2121 transitions. [2024-11-14 03:35:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 03:35:36,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:36,258 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-14 03:35:36,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:35:36,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:35:36,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1391261915, now seen corresponding path program 1 times [2024-11-14 03:35:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:36,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330082131] [2024-11-14 03:35:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:35:36,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:35:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:35:36,520 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:35:36,520 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:35:36,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:35:36,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:35:36,527 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:36,677 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:35:36,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:35:36 BoogieIcfgContainer [2024-11-14 03:35:36,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:35:36,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:35:36,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:35:36,680 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:35:36,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:34:34" (3/4) ... [2024-11-14 03:35:36,682 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 03:35:36,843 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 03:35:36,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:35:36,844 INFO L158 Benchmark]: Toolchain (without parser) took 64293.90ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 118.3MB in the beginning and 763.1MB in the end (delta: -644.7MB). Peak memory consumption was 298.0MB. Max. memory is 16.1GB. [2024-11-14 03:35:36,845 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 142.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:35:36,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.01ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:35:36,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.34ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 96.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:35:36,845 INFO L158 Benchmark]: Boogie Preprocessor took 64.54ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:35:36,846 INFO L158 Benchmark]: RCFGBuilder took 1528.95ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 76.6MB in the end (delta: 17.4MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-11-14 03:35:36,846 INFO L158 Benchmark]: TraceAbstraction took 61860.30ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 76.0MB in the beginning and 779.8MB in the end (delta: -703.8MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. [2024-11-14 03:35:36,846 INFO L158 Benchmark]: Witness Printer took 162.91ms. Allocated memory is still 1.1GB. Free memory was 779.8MB in the beginning and 763.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:35:36,850 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 142.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.01ms. Allocated memory is still 142.6MB. Free memory was 118.1MB in the beginning and 100.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.34ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 96.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.54ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1528.95ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 76.6MB in the end (delta: 17.4MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 61860.30ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 76.0MB in the beginning and 779.8MB in the end (delta: -703.8MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. * Witness Printer took 162.91ms. Allocated memory is still 1.1GB. Free memory was 779.8MB in the beginning and 763.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [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=0, 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=0, 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=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, 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 i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, 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] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_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, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [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 TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] COND FALSE !(!cond) [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, 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=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, 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=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.6s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2407 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2368 mSDsluCounter, 16693 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12646 mSDsCounter, 211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1872 IncrementalHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 211 mSolverCounterUnsat, 4047 mSDtfsCounter, 1872 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1651occurred in iteration=15, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 659 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1058 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1026 ConstructedInterpolants, 0 QuantifiedInterpolants, 2523 SizeOfPredicates, 15 NumberOfNonLiveVariables, 747 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 134/138 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-14 03:35:36,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8f76e77-dcc1-4d13-8bec-31afa2b100c0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE