./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:11:13,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:11:13,277 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 10:11:13,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:11:13,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:11:13,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:11:13,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:11:13,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:11:13,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:11:13,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:11:13,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:11:13,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:11:13,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:11:13,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:11:13,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 10:11:13,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:11:13,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:11:13,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:11:13,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:11:13,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:11:13,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:11:13,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-12-02 10:11:13,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:11:13,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:11:13,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:11:13,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:11:13,584 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:11:13,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-12-02 10:11:16,302 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/data/dd57de848/cb868f2ef327492baabe81a0c9e93ab4/FLAG168a87a93 [2024-12-02 10:11:16,555 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:11:16,556 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-12-02 10:11:16,565 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/data/dd57de848/cb868f2ef327492baabe81a0c9e93ab4/FLAG168a87a93 [2024-12-02 10:11:16,581 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/data/dd57de848/cb868f2ef327492baabe81a0c9e93ab4 [2024-12-02 10:11:16,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:11:16,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:11:16,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:11:16,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:11:16,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:11:16,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6031e901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16, skipping insertion in model container [2024-12-02 10:11:16,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:11:16,814 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_77b1fd64-adef-4dbd-a2dc-c723462a21d7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-12-02 10:11:16,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:11:16,827 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:11:16,887 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_77b1fd64-adef-4dbd-a2dc-c723462a21d7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-12-02 10:11:16,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:11:16,901 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:11:16,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16 WrapperNode [2024-12-02 10:11:16,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:11:16,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:11:16,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:11:16,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:11:16,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,948 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 418 [2024-12-02 10:11:16,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:11:16,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:11:16,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:11:16,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:11:16,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 10:11:16,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:16,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:17,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:11:17,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:11:17,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:11:17,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:11:17,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (1/1) ... [2024-12-02 10:11:17,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:11:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:17,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:11:17,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:11:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:11:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-12-02 10:11:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-12-02 10:11:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-12-02 10:11:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-12-02 10:11:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-12-02 10:11:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-12-02 10:11:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-12-02 10:11:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-12-02 10:11:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-12-02 10:11:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-12-02 10:11:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 10:11:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 10:11:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 10:11:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:11:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:11:17,157 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:11:17,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:11:17,717 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-12-02 10:11:17,717 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:11:17,731 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:11:17,731 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-02 10:11:17,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:11:17 BoogieIcfgContainer [2024-12-02 10:11:17,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:11:17,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:11:17,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:11:17,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:11:17,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:11:16" (1/3) ... [2024-12-02 10:11:17,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274b2f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:11:17, skipping insertion in model container [2024-12-02 10:11:17,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:11:16" (2/3) ... [2024-12-02 10:11:17,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274b2f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:11:17, skipping insertion in model container [2024-12-02 10:11:17,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:11:17" (3/3) ... [2024-12-02 10:11:17,740 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-12-02 10:11:17,752 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:11:17,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c that has 7 procedures, 178 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-12-02 10:11:17,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:11:17,827 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38a9c6d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:11:17,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 10:11:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-12-02 10:11:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-02 10:11:17,839 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:17,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:17,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash -990425789, now seen corresponding path program 1 times [2024-12-02 10:11:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:17,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516349715] [2024-12-02 10:11:17,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516349715] [2024-12-02 10:11:18,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516349715] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:18,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:18,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163575368] [2024-12-02 10:11:18,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:18,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:18,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:18,157 INFO L87 Difference]: Start difference. First operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:18,282 INFO L93 Difference]: Finished difference Result 355 states and 608 transitions. [2024-12-02 10:11:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-12-02 10:11:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:18,294 INFO L225 Difference]: With dead ends: 355 [2024-12-02 10:11:18,294 INFO L226 Difference]: Without dead ends: 180 [2024-12-02 10:11:18,299 INFO L434 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-12-02 10:11:18,301 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 7 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:18,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 803 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-12-02 10:11:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-12-02 10:11:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 139 states have internal predecessors, (210), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-12-02 10:11:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2024-12-02 10:11:18,355 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 15 [2024-12-02 10:11:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:18,356 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2024-12-02 10:11:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2024-12-02 10:11:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 10:11:18,358 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:18,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:18,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 10:11:18,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:18,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:18,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1702670267, now seen corresponding path program 1 times [2024-12-02 10:11:18,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336833414] [2024-12-02 10:11:18,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:18,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336833414] [2024-12-02 10:11:18,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336833414] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:18,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:18,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:18,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873718651] [2024-12-02 10:11:18,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:18,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:18,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:18,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:18,472 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:18,541 INFO L93 Difference]: Finished difference Result 373 states and 591 transitions. [2024-12-02 10:11:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-12-02 10:11:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:18,544 INFO L225 Difference]: With dead ends: 373 [2024-12-02 10:11:18,544 INFO L226 Difference]: Without dead ends: 196 [2024-12-02 10:11:18,545 INFO L434 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-12-02 10:11:18,546 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:18,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 819 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-12-02 10:11:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-12-02 10:11:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-12-02 10:11:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2024-12-02 10:11:18,565 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 16 [2024-12-02 10:11:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:18,565 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2024-12-02 10:11:18,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:11:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2024-12-02 10:11:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-02 10:11:18,567 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:18,567 INFO L218 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] [2024-12-02 10:11:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 10:11:18,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1283584726, now seen corresponding path program 1 times [2024-12-02 10:11:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:18,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69183352] [2024-12-02 10:11:18,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69183352] [2024-12-02 10:11:18,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69183352] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:18,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:11:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580853021] [2024-12-02 10:11:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:18,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:18,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:18,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:18,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:18,659 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 10:11:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:18,683 INFO L93 Difference]: Finished difference Result 405 states and 637 transitions. [2024-12-02 10:11:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-12-02 10:11:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:18,686 INFO L225 Difference]: With dead ends: 405 [2024-12-02 10:11:18,686 INFO L226 Difference]: Without dead ends: 222 [2024-12-02 10:11:18,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:11:18,688 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 22 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 550 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-12-02 10:11:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 195. [2024-12-02 10:11:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.527027027027027) internal successors, (226), 152 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-12-02 10:11:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2024-12-02 10:11:18,704 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 24 [2024-12-02 10:11:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:18,704 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2024-12-02 10:11:18,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 10:11:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2024-12-02 10:11:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-02 10:11:18,706 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:18,706 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 10:11:18,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 10:11:18,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:18,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1169101943, now seen corresponding path program 1 times [2024-12-02 10:11:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274285426] [2024-12-02 10:11:18,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:18,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274285426] [2024-12-02 10:11:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274285426] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:18,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194111045] [2024-12-02 10:11:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:18,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:11:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:18,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:11:18,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:18,802 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:18,844 INFO L93 Difference]: Finished difference Result 380 states and 593 transitions. [2024-12-02 10:11:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:18,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-12-02 10:11:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:18,847 INFO L225 Difference]: With dead ends: 380 [2024-12-02 10:11:18,847 INFO L226 Difference]: Without dead ends: 201 [2024-12-02 10:11:18,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:18,848 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:18,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1094 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-12-02 10:11:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-12-02 10:11:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 155 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-12-02 10:11:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 306 transitions. [2024-12-02 10:11:18,862 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 306 transitions. Word has length 32 [2024-12-02 10:11:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:18,863 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 306 transitions. [2024-12-02 10:11:18,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 306 transitions. [2024-12-02 10:11:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 10:11:18,864 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:18,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:18,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 10:11:18,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2121673051, now seen corresponding path program 1 times [2024-12-02 10:11:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:18,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718173143] [2024-12-02 10:11:18,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718173143] [2024-12-02 10:11:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718173143] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:11:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857726961] [2024-12-02 10:11:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:18,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:18,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:18,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:18,994 INFO L87 Difference]: Start difference. First operand 199 states and 306 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-12-02 10:11:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:19,082 INFO L93 Difference]: Finished difference Result 343 states and 534 transitions. [2024-12-02 10:11:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:11:19,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-12-02 10:11:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:19,085 INFO L225 Difference]: With dead ends: 343 [2024-12-02 10:11:19,085 INFO L226 Difference]: Without dead ends: 195 [2024-12-02 10:11:19,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:19,087 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 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-12-02 10:11:19,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:11:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-02 10:11:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-12-02 10:11:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 152 states have internal predecessors, (221), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-12-02 10:11:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 297 transitions. [2024-12-02 10:11:19,103 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 297 transitions. Word has length 35 [2024-12-02 10:11:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 297 transitions. [2024-12-02 10:11:19,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-12-02 10:11:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 297 transitions. [2024-12-02 10:11:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-02 10:11:19,104 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:19,105 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 10:11:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 10:11:19,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1881131524, now seen corresponding path program 1 times [2024-12-02 10:11:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416388419] [2024-12-02 10:11:19,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416388419] [2024-12-02 10:11:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416388419] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946059779] [2024-12-02 10:11:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:19,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:19,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:19,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:19,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 10:11:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:19,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:11:19,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:19,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:11:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946059779] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:11:19,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:11:19,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-12-02 10:11:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172063134] [2024-12-02 10:11:19,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:11:19,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:19,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:19,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:19,420 INFO L87 Difference]: Start difference. First operand 195 states and 297 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 10:11:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:19,475 INFO L93 Difference]: Finished difference Result 438 states and 681 transitions. [2024-12-02 10:11:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:19,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-12-02 10:11:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:19,479 INFO L225 Difference]: With dead ends: 438 [2024-12-02 10:11:19,479 INFO L226 Difference]: Without dead ends: 254 [2024-12-02 10:11:19,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:19,480 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 94 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:19,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 804 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-12-02 10:11:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2024-12-02 10:11:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 195 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-12-02 10:11:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 376 transitions. [2024-12-02 10:11:19,498 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 376 transitions. Word has length 35 [2024-12-02 10:11:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:19,498 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 376 transitions. [2024-12-02 10:11:19,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 10:11:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 376 transitions. [2024-12-02 10:11:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 10:11:19,499 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:19,499 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:19,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 10:11:19,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:19,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 264200636, now seen corresponding path program 2 times [2024-12-02 10:11:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:19,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885939622] [2024-12-02 10:11:19,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:11:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:19,720 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:11:19,720 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:11:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-02 10:11:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885939622] [2024-12-02 10:11:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885939622] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598353664] [2024-12-02 10:11:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:19,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:19,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:19,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:19,760 INFO L87 Difference]: Start difference. First operand 248 states and 376 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:19,832 INFO L93 Difference]: Finished difference Result 465 states and 730 transitions. [2024-12-02 10:11:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-12-02 10:11:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:19,835 INFO L225 Difference]: With dead ends: 465 [2024-12-02 10:11:19,836 INFO L226 Difference]: Without dead ends: 246 [2024-12-02 10:11:19,837 INFO L434 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-12-02 10:11:19,838 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 7 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:19,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 756 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-12-02 10:11:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-12-02 10:11:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 190 states have (on average 1.4631578947368422) internal successors, (278), 194 states have internal predecessors, (278), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 10:11:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 372 transitions. [2024-12-02 10:11:19,857 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 372 transitions. Word has length 57 [2024-12-02 10:11:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:19,857 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 372 transitions. [2024-12-02 10:11:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 372 transitions. [2024-12-02 10:11:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-02 10:11:19,859 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:19,859 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 10:11:19,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1186474451, now seen corresponding path program 1 times [2024-12-02 10:11:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143434597] [2024-12-02 10:11:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-02 10:11:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143434597] [2024-12-02 10:11:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143434597] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423985178] [2024-12-02 10:11:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:19,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:19,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:19,959 INFO L87 Difference]: Start difference. First operand 246 states and 372 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:20,012 INFO L93 Difference]: Finished difference Result 470 states and 728 transitions. [2024-12-02 10:11:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-12-02 10:11:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:20,016 INFO L225 Difference]: With dead ends: 470 [2024-12-02 10:11:20,016 INFO L226 Difference]: Without dead ends: 253 [2024-12-02 10:11:20,017 INFO L434 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-12-02 10:11:20,018 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 8 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:20,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 781 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-12-02 10:11:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-12-02 10:11:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 200 states have internal predecessors, (286), 47 states have call successors, (47), 9 states have call predecessors, (47), 9 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 10:11:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 380 transitions. [2024-12-02 10:11:20,035 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 380 transitions. Word has length 57 [2024-12-02 10:11:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:20,035 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 380 transitions. [2024-12-02 10:11:20,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 380 transitions. [2024-12-02 10:11:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-02 10:11:20,036 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:20,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:20,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 10:11:20,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:20,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1675858075, now seen corresponding path program 1 times [2024-12-02 10:11:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850289335] [2024-12-02 10:11:20,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-12-02 10:11:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850289335] [2024-12-02 10:11:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850289335] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:20,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630460140] [2024-12-02 10:11:20,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:20,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:20,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:20,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:20,128 INFO L87 Difference]: Start difference. First operand 253 states and 380 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:20,180 INFO L93 Difference]: Finished difference Result 516 states and 786 transitions. [2024-12-02 10:11:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-12-02 10:11:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:20,183 INFO L225 Difference]: With dead ends: 516 [2024-12-02 10:11:20,183 INFO L226 Difference]: Without dead ends: 292 [2024-12-02 10:11:20,184 INFO L434 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-12-02 10:11:20,185 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 24 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:20,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 799 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-12-02 10:11:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-12-02 10:11:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 232 states have internal predecessors, (323), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-12-02 10:11:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2024-12-02 10:11:20,205 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 58 [2024-12-02 10:11:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:20,205 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2024-12-02 10:11:20,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:11:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2024-12-02 10:11:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-02 10:11:20,206 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:20,207 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 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] [2024-12-02 10:11:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 10:11:20,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash 139669448, now seen corresponding path program 1 times [2024-12-02 10:11:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935593363] [2024-12-02 10:11:20,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-12-02 10:11:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935593363] [2024-12-02 10:11:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935593363] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466635312] [2024-12-02 10:11:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:20,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:11:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:20,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:11:20,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:20,333 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:11:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:20,379 INFO L93 Difference]: Finished difference Result 527 states and 785 transitions. [2024-12-02 10:11:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:20,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 76 [2024-12-02 10:11:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:20,382 INFO L225 Difference]: With dead ends: 527 [2024-12-02 10:11:20,382 INFO L226 Difference]: Without dead ends: 291 [2024-12-02 10:11:20,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:20,384 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:20,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-12-02 10:11:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2024-12-02 10:11:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 232 states have internal predecessors, (320), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-12-02 10:11:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 420 transitions. [2024-12-02 10:11:20,409 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 420 transitions. Word has length 76 [2024-12-02 10:11:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:20,409 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 420 transitions. [2024-12-02 10:11:20,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:11:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 420 transitions. [2024-12-02 10:11:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-02 10:11:20,411 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:20,411 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 10:11:20,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 10:11:20,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash -356940575, now seen corresponding path program 1 times [2024-12-02 10:11:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441997763] [2024-12-02 10:11:20,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-12-02 10:11:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441997763] [2024-12-02 10:11:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441997763] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718192085] [2024-12-02 10:11:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:20,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:20,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:20,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:20,541 INFO L87 Difference]: Start difference. First operand 289 states and 420 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:11:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:20,605 INFO L93 Difference]: Finished difference Result 514 states and 769 transitions. [2024-12-02 10:11:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-12-02 10:11:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:20,608 INFO L225 Difference]: With dead ends: 514 [2024-12-02 10:11:20,608 INFO L226 Difference]: Without dead ends: 283 [2024-12-02 10:11:20,610 INFO L434 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-12-02 10:11:20,610 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 9 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:20,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 764 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-12-02 10:11:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-12-02 10:11:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 227 states have internal predecessors, (308), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-12-02 10:11:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 406 transitions. [2024-12-02 10:11:20,633 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 406 transitions. Word has length 105 [2024-12-02 10:11:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:20,633 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 406 transitions. [2024-12-02 10:11:20,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:11:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 406 transitions. [2024-12-02 10:11:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-02 10:11:20,636 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:20,636 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 10:11:20,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 10:11:20,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:20,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash -365410092, now seen corresponding path program 1 times [2024-12-02 10:11:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:20,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835586949] [2024-12-02 10:11:20,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-12-02 10:11:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835586949] [2024-12-02 10:11:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835586949] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435837232] [2024-12-02 10:11:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:20,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:20,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 10:11:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:21,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:11:21,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-12-02 10:11:21,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435837232] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:21,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-12-02 10:11:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313384683] [2024-12-02 10:11:21,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:21,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:21,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:21,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:21,069 INFO L87 Difference]: Start difference. First operand 283 states and 406 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-12-02 10:11:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:21,138 INFO L93 Difference]: Finished difference Result 511 states and 749 transitions. [2024-12-02 10:11:21,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 139 [2024-12-02 10:11:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:21,141 INFO L225 Difference]: With dead ends: 511 [2024-12-02 10:11:21,141 INFO L226 Difference]: Without dead ends: 266 [2024-12-02 10:11:21,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:21,142 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 35 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:21,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 720 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-12-02 10:11:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-12-02 10:11:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 209 states have (on average 1.3732057416267942) internal successors, (287), 213 states have internal predecessors, (287), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-12-02 10:11:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 379 transitions. [2024-12-02 10:11:21,157 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 379 transitions. Word has length 139 [2024-12-02 10:11:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:21,157 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 379 transitions. [2024-12-02 10:11:21,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-12-02 10:11:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 379 transitions. [2024-12-02 10:11:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-02 10:11:21,159 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:21,159 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2024-12-02 10:11:21,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 10:11:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:21,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1186353610, now seen corresponding path program 1 times [2024-12-02 10:11:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612807504] [2024-12-02 10:11:21,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-12-02 10:11:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612807504] [2024-12-02 10:11:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612807504] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347050394] [2024-12-02 10:11:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:21,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:21,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:21,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 10:11:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:21,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:11:21,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-12-02 10:11:21,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:21,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347050394] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-12-02 10:11:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841463740] [2024-12-02 10:11:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:21,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:21,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:21,730 INFO L87 Difference]: Start difference. First operand 266 states and 379 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-12-02 10:11:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:21,795 INFO L93 Difference]: Finished difference Result 477 states and 695 transitions. [2024-12-02 10:11:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:21,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2024-12-02 10:11:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:21,798 INFO L225 Difference]: With dead ends: 477 [2024-12-02 10:11:21,798 INFO L226 Difference]: Without dead ends: 247 [2024-12-02 10:11:21,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:21,799 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 37 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:21,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 716 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-12-02 10:11:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-12-02 10:11:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 197 states have internal predecessors, (264), 43 states have call successors, (43), 10 states have call predecessors, (43), 10 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-12-02 10:11:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 350 transitions. [2024-12-02 10:11:21,809 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 350 transitions. Word has length 143 [2024-12-02 10:11:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:21,809 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 350 transitions. [2024-12-02 10:11:21,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-12-02 10:11:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 350 transitions. [2024-12-02 10:11:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 10:11:21,811 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:21,812 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 10:11:21,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 10:11:22,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-12-02 10:11:22,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:22,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -596810665, now seen corresponding path program 1 times [2024-12-02 10:11:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462905266] [2024-12-02 10:11:22,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-12-02 10:11:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462905266] [2024-12-02 10:11:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462905266] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957166450] [2024-12-02 10:11:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:22,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:22,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 10:11:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:22,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:11:22,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-12-02 10:11:22,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957166450] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-12-02 10:11:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557251241] [2024-12-02 10:11:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:22,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:22,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:22,302 INFO L87 Difference]: Start difference. First operand 247 states and 350 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-12-02 10:11:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:22,380 INFO L93 Difference]: Finished difference Result 468 states and 678 transitions. [2024-12-02 10:11:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2024-12-02 10:11:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:22,382 INFO L225 Difference]: With dead ends: 468 [2024-12-02 10:11:22,382 INFO L226 Difference]: Without dead ends: 279 [2024-12-02 10:11:22,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:22,383 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 33 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:22,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 729 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:11:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-12-02 10:11:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-12-02 10:11:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 221 states have (on average 1.3665158371040724) internal successors, (302), 225 states have internal predecessors, (302), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-12-02 10:11:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 394 transitions. [2024-12-02 10:11:22,395 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 394 transitions. Word has length 146 [2024-12-02 10:11:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:22,395 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 394 transitions. [2024-12-02 10:11:22,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-12-02 10:11:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 394 transitions. [2024-12-02 10:11:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-02 10:11:22,397 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:22,397 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-12-02 10:11:22,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 10:11:22,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:22,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:22,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1774969279, now seen corresponding path program 2 times [2024-12-02 10:11:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800069093] [2024-12-02 10:11:22,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:11:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:22,618 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:11:22,618 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:11:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-12-02 10:11:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800069093] [2024-12-02 10:11:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800069093] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270171466] [2024-12-02 10:11:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:22,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:22,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:22,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:22,658 INFO L87 Difference]: Start difference. First operand 279 states and 394 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-12-02 10:11:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:22,697 INFO L93 Difference]: Finished difference Result 423 states and 613 transitions. [2024-12-02 10:11:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:22,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 146 [2024-12-02 10:11:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:22,700 INFO L225 Difference]: With dead ends: 423 [2024-12-02 10:11:22,700 INFO L226 Difference]: Without dead ends: 283 [2024-12-02 10:11:22,700 INFO L434 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-12-02 10:11:22,701 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 3 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:22,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 773 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-12-02 10:11:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-12-02 10:11:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 224 states have (on average 1.3616071428571428) internal successors, (305), 228 states have internal predecessors, (305), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-12-02 10:11:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 397 transitions. [2024-12-02 10:11:22,716 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 397 transitions. Word has length 146 [2024-12-02 10:11:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:22,717 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 397 transitions. [2024-12-02 10:11:22,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-12-02 10:11:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 397 transitions. [2024-12-02 10:11:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 10:11:22,719 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:22,719 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 10:11:22,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash -976665692, now seen corresponding path program 1 times [2024-12-02 10:11:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:22,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624978913] [2024-12-02 10:11:22,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-12-02 10:11:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:22,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624978913] [2024-12-02 10:11:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624978913] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:22,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303916079] [2024-12-02 10:11:22,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:22,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:22,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:22,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:22,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 10:11:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:23,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:23,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-12-02 10:11:23,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303916079] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:23,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-12-02 10:11:23,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70450153] [2024-12-02 10:11:23,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:23,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:23,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:23,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:23,047 INFO L87 Difference]: Start difference. First operand 283 states and 397 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-12-02 10:11:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:23,085 INFO L93 Difference]: Finished difference Result 432 states and 621 transitions. [2024-12-02 10:11:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 153 [2024-12-02 10:11:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:23,088 INFO L225 Difference]: With dead ends: 432 [2024-12-02 10:11:23,088 INFO L226 Difference]: Without dead ends: 288 [2024-12-02 10:11:23,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:23,089 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 4 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:23,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 775 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-12-02 10:11:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-12-02 10:11:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 228 states have (on average 1.355263157894737) internal successors, (309), 232 states have internal predecessors, (309), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-12-02 10:11:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 401 transitions. [2024-12-02 10:11:23,103 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 401 transitions. Word has length 153 [2024-12-02 10:11:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 401 transitions. [2024-12-02 10:11:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-12-02 10:11:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 401 transitions. [2024-12-02 10:11:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 10:11:23,106 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:23,106 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:23,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-12-02 10:11:23,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:23,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:23,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -111657728, now seen corresponding path program 1 times [2024-12-02 10:11:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764926162] [2024-12-02 10:11:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-12-02 10:11:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764926162] [2024-12-02 10:11:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764926162] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:23,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11712072] [2024-12-02 10:11:23,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:23,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:23,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:23,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 10:11:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:23,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:23,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-12-02 10:11:23,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:23,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11712072] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:23,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-12-02 10:11:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561375923] [2024-12-02 10:11:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:23,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:23,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:23,671 INFO L87 Difference]: Start difference. First operand 288 states and 401 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-12-02 10:11:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:23,715 INFO L93 Difference]: Finished difference Result 436 states and 621 transitions. [2024-12-02 10:11:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 161 [2024-12-02 10:11:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:23,718 INFO L225 Difference]: With dead ends: 436 [2024-12-02 10:11:23,718 INFO L226 Difference]: Without dead ends: 287 [2024-12-02 10:11:23,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:23,719 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 5 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:23,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-12-02 10:11:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-12-02 10:11:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 228 states have (on average 1.3421052631578947) internal successors, (306), 231 states have internal predecessors, (306), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-12-02 10:11:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 396 transitions. [2024-12-02 10:11:23,730 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 396 transitions. Word has length 161 [2024-12-02 10:11:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:23,730 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 396 transitions. [2024-12-02 10:11:23,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-12-02 10:11:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 396 transitions. [2024-12-02 10:11:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-12-02 10:11:23,732 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:23,732 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:23,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 10:11:23,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 10:11:23,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:23,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1338057840, now seen corresponding path program 1 times [2024-12-02 10:11:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18053775] [2024-12-02 10:11:23,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-12-02 10:11:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18053775] [2024-12-02 10:11:24,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18053775] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464494060] [2024-12-02 10:11:24,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:24,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:24,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:24,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 10:11:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:24,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:24,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-12-02 10:11:24,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464494060] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-12-02 10:11:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993934435] [2024-12-02 10:11:24,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:24,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:24,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:24,335 INFO L87 Difference]: Start difference. First operand 287 states and 396 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-12-02 10:11:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:24,352 INFO L93 Difference]: Finished difference Result 434 states and 610 transitions. [2024-12-02 10:11:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 168 [2024-12-02 10:11:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:24,356 INFO L225 Difference]: With dead ends: 434 [2024-12-02 10:11:24,356 INFO L226 Difference]: Without dead ends: 286 [2024-12-02 10:11:24,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:24,357 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:24,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-12-02 10:11:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-12-02 10:11:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.337719298245614) internal successors, (305), 230 states have internal predecessors, (305), 44 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-12-02 10:11:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 393 transitions. [2024-12-02 10:11:24,373 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 393 transitions. Word has length 168 [2024-12-02 10:11:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:24,374 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 393 transitions. [2024-12-02 10:11:24,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-12-02 10:11:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2024-12-02 10:11:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-12-02 10:11:24,377 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:24,377 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:24,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 10:11:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-12-02 10:11:24,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1019610705, now seen corresponding path program 1 times [2024-12-02 10:11:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158583135] [2024-12-02 10:11:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-12-02 10:11:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158583135] [2024-12-02 10:11:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158583135] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880827708] [2024-12-02 10:11:24,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:24,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:24,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 10:11:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:24,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 10:11:24,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-12-02 10:11:24,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880827708] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:24,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-12-02 10:11:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248488054] [2024-12-02 10:11:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:24,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:24,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:24,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:24,992 INFO L87 Difference]: Start difference. First operand 286 states and 393 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-12-02 10:11:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:25,082 INFO L93 Difference]: Finished difference Result 651 states and 901 transitions. [2024-12-02 10:11:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 171 [2024-12-02 10:11:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:25,085 INFO L225 Difference]: With dead ends: 651 [2024-12-02 10:11:25,086 INFO L226 Difference]: Without dead ends: 504 [2024-12-02 10:11:25,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:25,087 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 335 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:25,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 713 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:11:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-12-02 10:11:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2024-12-02 10:11:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 393 states have (on average 1.3638676844783715) internal successors, (536), 395 states have internal predecessors, (536), 73 states have call successors, (73), 31 states have call predecessors, (73), 31 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-12-02 10:11:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 682 transitions. [2024-12-02 10:11:25,111 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 682 transitions. Word has length 171 [2024-12-02 10:11:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 682 transitions. [2024-12-02 10:11:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-12-02 10:11:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 682 transitions. [2024-12-02 10:11:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-02 10:11:25,115 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:25,115 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:25,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 10:11:25,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:25,315 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:25,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1518725476, now seen corresponding path program 1 times [2024-12-02 10:11:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764469505] [2024-12-02 10:11:25,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-12-02 10:11:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764469505] [2024-12-02 10:11:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764469505] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855098405] [2024-12-02 10:11:25,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:25,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:25,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 10:11:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:25,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:11:25,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-12-02 10:11:25,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855098405] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:25,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-12-02 10:11:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970837210] [2024-12-02 10:11:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:25,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:25,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:25,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:25,677 INFO L87 Difference]: Start difference. First operand 498 states and 682 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:25,771 INFO L93 Difference]: Finished difference Result 794 states and 1106 transitions. [2024-12-02 10:11:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 202 [2024-12-02 10:11:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:25,776 INFO L225 Difference]: With dead ends: 794 [2024-12-02 10:11:25,776 INFO L226 Difference]: Without dead ends: 498 [2024-12-02 10:11:25,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:25,777 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 31 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:25,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 700 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:11:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-12-02 10:11:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-12-02 10:11:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 393 states have (on average 1.3486005089058524) internal successors, (530), 395 states have internal predecessors, (530), 73 states have call successors, (73), 31 states have call predecessors, (73), 31 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-12-02 10:11:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 676 transitions. [2024-12-02 10:11:25,799 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 676 transitions. Word has length 202 [2024-12-02 10:11:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 676 transitions. [2024-12-02 10:11:25,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 676 transitions. [2024-12-02 10:11:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-12-02 10:11:25,801 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:25,801 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:25,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 10:11:26,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:26,002 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:26,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:26,002 INFO L85 PathProgramCache]: Analyzing trace with hash -466205611, now seen corresponding path program 1 times [2024-12-02 10:11:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400114659] [2024-12-02 10:11:26,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-12-02 10:11:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400114659] [2024-12-02 10:11:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400114659] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201892966] [2024-12-02 10:11:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:26,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:26,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 10:11:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:26,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:11:26,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-12-02 10:11:26,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201892966] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-12-02 10:11:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953391563] [2024-12-02 10:11:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:26,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:26,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:26,357 INFO L87 Difference]: Start difference. First operand 498 states and 676 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:26,439 INFO L93 Difference]: Finished difference Result 794 states and 1092 transitions. [2024-12-02 10:11:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:26,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 203 [2024-12-02 10:11:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:26,443 INFO L225 Difference]: With dead ends: 794 [2024-12-02 10:11:26,443 INFO L226 Difference]: Without dead ends: 510 [2024-12-02 10:11:26,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:26,445 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:26,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 708 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 10:11:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-12-02 10:11:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-12-02 10:11:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 403 states have (on average 1.349875930521092) internal successors, (544), 405 states have internal predecessors, (544), 73 states have call successors, (73), 33 states have call predecessors, (73), 33 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-12-02 10:11:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 690 transitions. [2024-12-02 10:11:26,464 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 690 transitions. Word has length 203 [2024-12-02 10:11:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:26,465 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 690 transitions. [2024-12-02 10:11:26,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 690 transitions. [2024-12-02 10:11:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-12-02 10:11:26,467 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:26,467 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:26,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-12-02 10:11:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:26,668 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:26,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 322582070, now seen corresponding path program 1 times [2024-12-02 10:11:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971694380] [2024-12-02 10:11:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-12-02 10:11:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971694380] [2024-12-02 10:11:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971694380] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200012777] [2024-12-02 10:11:26,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:26,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:26,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:26,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 10:11:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:27,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 10:11:27,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-12-02 10:11:27,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200012777] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-12-02 10:11:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746318584] [2024-12-02 10:11:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:27,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:27,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:27,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:27,097 INFO L87 Difference]: Start difference. First operand 510 states and 690 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-12-02 10:11:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:27,152 INFO L93 Difference]: Finished difference Result 1112 states and 1526 transitions. [2024-12-02 10:11:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 204 [2024-12-02 10:11:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:27,158 INFO L225 Difference]: With dead ends: 1112 [2024-12-02 10:11:27,158 INFO L226 Difference]: Without dead ends: 816 [2024-12-02 10:11:27,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:27,161 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 164 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:27,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 530 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-12-02 10:11:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 633. [2024-12-02 10:11:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 501 states have (on average 1.3532934131736527) internal successors, (678), 507 states have internal predecessors, (678), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-12-02 10:11:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 854 transitions. [2024-12-02 10:11:27,206 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 854 transitions. Word has length 204 [2024-12-02 10:11:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:27,207 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 854 transitions. [2024-12-02 10:11:27,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-12-02 10:11:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 854 transitions. [2024-12-02 10:11:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-02 10:11:27,210 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:27,210 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:27,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 10:11:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 10:11:27,411 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash -374103570, now seen corresponding path program 1 times [2024-12-02 10:11:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088081921] [2024-12-02 10:11:27,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-12-02 10:11:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088081921] [2024-12-02 10:11:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088081921] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234306993] [2024-12-02 10:11:27,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:27,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:27,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:27,522 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:27,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 10:11:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:27,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 10:11:27,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-12-02 10:11:27,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234306993] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-12-02 10:11:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957596300] [2024-12-02 10:11:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:27,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:27,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:27,783 INFO L87 Difference]: Start difference. First operand 633 states and 854 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-12-02 10:11:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:27,836 INFO L93 Difference]: Finished difference Result 1395 states and 1902 transitions. [2024-12-02 10:11:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:27,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 205 [2024-12-02 10:11:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:27,841 INFO L225 Difference]: With dead ends: 1395 [2024-12-02 10:11:27,841 INFO L226 Difference]: Without dead ends: 1012 [2024-12-02 10:11:27,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:27,843 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 168 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:27,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 546 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-12-02 10:11:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1004. [2024-12-02 10:11:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 790 states have (on average 1.3658227848101265) internal successors, (1079), 804 states have internal predecessors, (1079), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 132 states have call predecessors, (142), 142 states have call successors, (142) [2024-12-02 10:11:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1363 transitions. [2024-12-02 10:11:27,885 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1363 transitions. Word has length 205 [2024-12-02 10:11:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:27,885 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1363 transitions. [2024-12-02 10:11:27,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-12-02 10:11:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1363 transitions. [2024-12-02 10:11:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-02 10:11:27,887 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:27,887 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:27,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 10:11:28,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 10:11:28,088 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:28,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash -922436527, now seen corresponding path program 1 times [2024-12-02 10:11:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915874599] [2024-12-02 10:11:28,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-12-02 10:11:28,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:28,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915874599] [2024-12-02 10:11:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915874599] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:28,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674038263] [2024-12-02 10:11:28,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:28,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:28,211 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:28,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 10:11:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:28,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 10:11:28,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-12-02 10:11:28,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674038263] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-12-02 10:11:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719449243] [2024-12-02 10:11:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:11:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:11:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:28,455 INFO L87 Difference]: Start difference. First operand 1004 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:28,529 INFO L93 Difference]: Finished difference Result 2340 states and 3213 transitions. [2024-12-02 10:11:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:11:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 206 [2024-12-02 10:11:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:28,536 INFO L225 Difference]: With dead ends: 2340 [2024-12-02 10:11:28,536 INFO L226 Difference]: Without dead ends: 1632 [2024-12-02 10:11:28,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:28,538 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 175 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:28,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 563 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-12-02 10:11:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1618. [2024-12-02 10:11:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1268 states have (on average 1.3809148264984228) internal successors, (1751), 1296 states have internal predecessors, (1751), 234 states have call successors, (234), 115 states have call predecessors, (234), 115 states have return successors, (234), 214 states have call predecessors, (234), 234 states have call successors, (234) [2024-12-02 10:11:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2219 transitions. [2024-12-02 10:11:28,604 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2219 transitions. Word has length 206 [2024-12-02 10:11:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:28,605 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2219 transitions. [2024-12-02 10:11:28,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2219 transitions. [2024-12-02 10:11:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-02 10:11:28,606 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:28,607 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:28,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 10:11:28,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 10:11:28,807 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:28,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1951795825, now seen corresponding path program 1 times [2024-12-02 10:11:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561909019] [2024-12-02 10:11:28,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-12-02 10:11:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561909019] [2024-12-02 10:11:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561909019] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051124516] [2024-12-02 10:11:28,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:28,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:28,909 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:28,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 10:11:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:29,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 10:11:29,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-12-02 10:11:29,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:29,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051124516] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:29,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:29,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-12-02 10:11:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905076698] [2024-12-02 10:11:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:29,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:11:29,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:29,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:11:29,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:29,139 INFO L87 Difference]: Start difference. First operand 1618 states and 2219 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:29,191 INFO L93 Difference]: Finished difference Result 3079 states and 4237 transitions. [2024-12-02 10:11:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 206 [2024-12-02 10:11:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:29,197 INFO L225 Difference]: With dead ends: 3079 [2024-12-02 10:11:29,197 INFO L226 Difference]: Without dead ends: 1620 [2024-12-02 10:11:29,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:11:29,200 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:29,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1019 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-12-02 10:11:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1618. [2024-12-02 10:11:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1268 states have (on average 1.3761829652996846) internal successors, (1745), 1296 states have internal predecessors, (1745), 234 states have call successors, (234), 115 states have call predecessors, (234), 115 states have return successors, (234), 214 states have call predecessors, (234), 234 states have call successors, (234) [2024-12-02 10:11:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2213 transitions. [2024-12-02 10:11:29,258 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2213 transitions. Word has length 206 [2024-12-02 10:11:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:29,259 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2213 transitions. [2024-12-02 10:11:29,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2213 transitions. [2024-12-02 10:11:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-02 10:11:29,262 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:29,262 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:29,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 10:11:29,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 10:11:29,463 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash -984539219, now seen corresponding path program 1 times [2024-12-02 10:11:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312251948] [2024-12-02 10:11:29,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-12-02 10:11:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312251948] [2024-12-02 10:11:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312251948] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622859558] [2024-12-02 10:11:29,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:29,630 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:29,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 10:11:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:29,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:29,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 129 proven. 11 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-12-02 10:11:29,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-12-02 10:11:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622859558] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 10:11:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2024-12-02 10:11:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143114155] [2024-12-02 10:11:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:30,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:30,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:30,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:30,041 INFO L87 Difference]: Start difference. First operand 1618 states and 2213 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-12-02 10:11:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:30,121 INFO L93 Difference]: Finished difference Result 3101 states and 4261 transitions. [2024-12-02 10:11:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:11:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 213 [2024-12-02 10:11:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:30,130 INFO L225 Difference]: With dead ends: 3101 [2024-12-02 10:11:30,130 INFO L226 Difference]: Without dead ends: 1609 [2024-12-02 10:11:30,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:11:30,133 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 35 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:30,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 479 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-12-02 10:11:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2024-12-02 10:11:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1262 states have (on average 1.3708399366085577) internal successors, (1730), 1290 states have internal predecessors, (1730), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-12-02 10:11:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2192 transitions. [2024-12-02 10:11:30,196 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2192 transitions. Word has length 213 [2024-12-02 10:11:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:30,197 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2192 transitions. [2024-12-02 10:11:30,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-12-02 10:11:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2192 transitions. [2024-12-02 10:11:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-02 10:11:30,199 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:30,199 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:30,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 10:11:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 10:11:30,400 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:30,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 181069920, now seen corresponding path program 1 times [2024-12-02 10:11:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:30,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271695735] [2024-12-02 10:11:30,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2024-12-02 10:11:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271695735] [2024-12-02 10:11:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271695735] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215767475] [2024-12-02 10:11:30,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:30,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:30,574 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:30,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 10:11:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:30,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-02 10:11:30,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-12-02 10:11:30,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215767475] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:30,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-12-02 10:11:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789329968] [2024-12-02 10:11:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:11:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:30,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:11:30,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:30,820 INFO L87 Difference]: Start difference. First operand 1609 states and 2192 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:30,896 INFO L93 Difference]: Finished difference Result 3109 states and 4254 transitions. [2024-12-02 10:11:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:30,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 237 [2024-12-02 10:11:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:30,906 INFO L225 Difference]: With dead ends: 3109 [2024-12-02 10:11:30,906 INFO L226 Difference]: Without dead ends: 1609 [2024-12-02 10:11:30,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:30,910 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:30,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-12-02 10:11:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2024-12-02 10:11:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1262 states have (on average 1.3684627575277337) internal successors, (1727), 1290 states have internal predecessors, (1727), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-12-02 10:11:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2189 transitions. [2024-12-02 10:11:30,999 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2189 transitions. Word has length 237 [2024-12-02 10:11:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:30,999 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2189 transitions. [2024-12-02 10:11:30,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-12-02 10:11:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2189 transitions. [2024-12-02 10:11:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-02 10:11:31,002 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:31,002 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:31,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-12-02 10:11:31,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-12-02 10:11:31,202 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:31,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1381168359, now seen corresponding path program 1 times [2024-12-02 10:11:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792248023] [2024-12-02 10:11:31,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 83 proven. 73 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-12-02 10:11:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792248023] [2024-12-02 10:11:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792248023] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601026714] [2024-12-02 10:11:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:31,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:31,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:31,291 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:31,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 10:11:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:31,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:31,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 260 proven. 9 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-12-02 10:11:31,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 92 proven. 64 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-12-02 10:11:31,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601026714] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:11:31,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:11:31,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-12-02 10:11:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95998968] [2024-12-02 10:11:31,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:11:31,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:11:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:31,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:11:31,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:31,687 INFO L87 Difference]: Start difference. First operand 1609 states and 2189 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 10:11:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:31,771 INFO L93 Difference]: Finished difference Result 3147 states and 4297 transitions. [2024-12-02 10:11:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 243 [2024-12-02 10:11:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:31,777 INFO L225 Difference]: With dead ends: 3147 [2024-12-02 10:11:31,778 INFO L226 Difference]: Without dead ends: 1606 [2024-12-02 10:11:31,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:31,780 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 32 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:31,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 912 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-12-02 10:11:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2024-12-02 10:11:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1259 states have (on average 1.3669579030976966) internal successors, (1721), 1287 states have internal predecessors, (1721), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-12-02 10:11:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2183 transitions. [2024-12-02 10:11:31,837 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2183 transitions. Word has length 243 [2024-12-02 10:11:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:31,838 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2183 transitions. [2024-12-02 10:11:31,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-12-02 10:11:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2183 transitions. [2024-12-02 10:11:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-12-02 10:11:31,840 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:31,840 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:31,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 10:11:32,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 10:11:32,040 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:32,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1839717551, now seen corresponding path program 1 times [2024-12-02 10:11:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:32,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480433985] [2024-12-02 10:11:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-12-02 10:11:32,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480433985] [2024-12-02 10:11:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480433985] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:11:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253497848] [2024-12-02 10:11:32,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:32,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:32,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:32,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:32,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:32,508 INFO L87 Difference]: Start difference. First operand 1606 states and 2183 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 10:11:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:32,668 INFO L93 Difference]: Finished difference Result 2444 states and 3546 transitions. [2024-12-02 10:11:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:11:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 270 [2024-12-02 10:11:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:32,682 INFO L225 Difference]: With dead ends: 2444 [2024-12-02 10:11:32,682 INFO L226 Difference]: Without dead ends: 2442 [2024-12-02 10:11:32,684 INFO L434 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-12-02 10:11:32,684 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 116 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:32,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1832 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2024-12-02 10:11:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 1654. [2024-12-02 10:11:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1291 states have (on average 1.3578621223857474) internal successors, (1753), 1327 states have internal predecessors, (1753), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2024-12-02 10:11:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2231 transitions. [2024-12-02 10:11:32,826 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2231 transitions. Word has length 270 [2024-12-02 10:11:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:32,827 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2231 transitions. [2024-12-02 10:11:32,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-12-02 10:11:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2231 transitions. [2024-12-02 10:11:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-02 10:11:32,831 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:32,831 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:32,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 10:11:32,831 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:32,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash -413546924, now seen corresponding path program 1 times [2024-12-02 10:11:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:32,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784684066] [2024-12-02 10:11:32,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-12-02 10:11:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784684066] [2024-12-02 10:11:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784684066] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703560003] [2024-12-02 10:11:33,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:33,270 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:33,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 10:11:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:33,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 10:11:33,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-12-02 10:11:33,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-12-02 10:11:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703560003] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:11:34,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:11:34,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2024-12-02 10:11:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435452976] [2024-12-02 10:11:34,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:11:34,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 10:11:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:34,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 10:11:34,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-12-02 10:11:34,027 INFO L87 Difference]: Start difference. First operand 1654 states and 2231 transitions. Second operand has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-12-02 10:11:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:34,525 INFO L93 Difference]: Finished difference Result 4058 states and 5664 transitions. [2024-12-02 10:11:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 10:11:34,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 278 [2024-12-02 10:11:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:34,539 INFO L225 Difference]: With dead ends: 4058 [2024-12-02 10:11:34,539 INFO L226 Difference]: Without dead ends: 2708 [2024-12-02 10:11:34,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 547 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-12-02 10:11:34,543 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 337 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:34,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 3491 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 10:11:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2024-12-02 10:11:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2480. [2024-12-02 10:11:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 1934 states have (on average 1.3536711478800414) internal successors, (2618), 1986 states have internal predecessors, (2618), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2024-12-02 10:11:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3338 transitions. [2024-12-02 10:11:34,704 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3338 transitions. Word has length 278 [2024-12-02 10:11:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:34,704 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3338 transitions. [2024-12-02 10:11:34,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-12-02 10:11:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3338 transitions. [2024-12-02 10:11:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-12-02 10:11:34,708 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:34,709 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:34,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-12-02 10:11:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:34,909 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:34,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash 548067093, now seen corresponding path program 1 times [2024-12-02 10:11:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653950209] [2024-12-02 10:11:34,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-12-02 10:11:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653950209] [2024-12-02 10:11:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653950209] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833192742] [2024-12-02 10:11:35,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:35,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:35,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:35,056 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:35,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 10:11:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:35,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:35,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-12-02 10:11:35,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833192742] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-12-02 10:11:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263363426] [2024-12-02 10:11:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:35,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:35,306 INFO L87 Difference]: Start difference. First operand 2480 states and 3338 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 10:11:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:35,441 INFO L93 Difference]: Finished difference Result 4793 states and 6552 transitions. [2024-12-02 10:11:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:35,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 278 [2024-12-02 10:11:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:35,453 INFO L225 Difference]: With dead ends: 4793 [2024-12-02 10:11:35,453 INFO L226 Difference]: Without dead ends: 2416 [2024-12-02 10:11:35,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 280 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-12-02 10:11:35,458 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:35,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 699 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2024-12-02 10:11:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2416. [2024-12-02 10:11:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1890 states have (on average 1.3375661375661376) internal successors, (2528), 1942 states have internal predecessors, (2528), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2024-12-02 10:11:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3212 transitions. [2024-12-02 10:11:35,591 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3212 transitions. Word has length 278 [2024-12-02 10:11:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:35,592 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3212 transitions. [2024-12-02 10:11:35,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-12-02 10:11:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3212 transitions. [2024-12-02 10:11:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-12-02 10:11:35,596 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:35,596 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:35,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-12-02 10:11:35,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:35,797 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1038977620, now seen corresponding path program 1 times [2024-12-02 10:11:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236308560] [2024-12-02 10:11:35,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:35,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-12-02 10:11:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236308560] [2024-12-02 10:11:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236308560] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034964952] [2024-12-02 10:11:35,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:35,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:35,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:35,937 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:35,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 10:11:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:36,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:11:36,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-12-02 10:11:36,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:36,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034964952] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:36,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:36,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-12-02 10:11:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135181679] [2024-12-02 10:11:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:36,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:36,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:36,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:36,181 INFO L87 Difference]: Start difference. First operand 2416 states and 3212 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-12-02 10:11:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:36,303 INFO L93 Difference]: Finished difference Result 4551 states and 6145 transitions. [2024-12-02 10:11:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 281 [2024-12-02 10:11:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:36,314 INFO L225 Difference]: With dead ends: 4551 [2024-12-02 10:11:36,315 INFO L226 Difference]: Without dead ends: 2220 [2024-12-02 10:11:36,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 282 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-12-02 10:11:36,320 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:36,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 727 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2024-12-02 10:11:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2220. [2024-12-02 10:11:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1724 states have (on average 1.324245939675174) internal successors, (2283), 1776 states have internal predecessors, (2283), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2024-12-02 10:11:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2929 transitions. [2024-12-02 10:11:36,462 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2929 transitions. Word has length 281 [2024-12-02 10:11:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:36,462 INFO L471 AbstractCegarLoop]: Abstraction has 2220 states and 2929 transitions. [2024-12-02 10:11:36,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-12-02 10:11:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2929 transitions. [2024-12-02 10:11:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-12-02 10:11:36,465 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:36,465 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:36,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-12-02 10:11:36,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:36,666 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:36,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1369389821, now seen corresponding path program 1 times [2024-12-02 10:11:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227159034] [2024-12-02 10:11:36,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-12-02 10:11:36,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227159034] [2024-12-02 10:11:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227159034] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046885179] [2024-12-02 10:11:36,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:36,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:36,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:36,945 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:36,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 10:11:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:37,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 10:11:37,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-12-02 10:11:37,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046885179] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:37,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2024-12-02 10:11:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294336684] [2024-12-02 10:11:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:11:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:37,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:11:37,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-12-02 10:11:37,281 INFO L87 Difference]: Start difference. First operand 2220 states and 2929 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 10:11:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:37,667 INFO L93 Difference]: Finished difference Result 5562 states and 7317 transitions. [2024-12-02 10:11:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:11:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 293 [2024-12-02 10:11:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:37,678 INFO L225 Difference]: With dead ends: 5562 [2024-12-02 10:11:37,678 INFO L226 Difference]: Without dead ends: 3948 [2024-12-02 10:11:37,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-12-02 10:11:37,681 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:37,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1693 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:11:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2024-12-02 10:11:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3934. [2024-12-02 10:11:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3934 states, 3034 states have (on average 1.3098220171390904) internal successors, (3974), 3134 states have internal predecessors, (3974), 583 states have call successors, (583), 316 states have call predecessors, (583), 316 states have return successors, (583), 491 states have call predecessors, (583), 583 states have call successors, (583) [2024-12-02 10:11:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 5140 transitions. [2024-12-02 10:11:37,872 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 5140 transitions. Word has length 293 [2024-12-02 10:11:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:37,873 INFO L471 AbstractCegarLoop]: Abstraction has 3934 states and 5140 transitions. [2024-12-02 10:11:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 10:11:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 5140 transitions. [2024-12-02 10:11:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-12-02 10:11:37,877 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:37,877 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:37,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-12-02 10:11:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:38,078 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1529579416, now seen corresponding path program 1 times [2024-12-02 10:11:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199224787] [2024-12-02 10:11:38,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2024-12-02 10:11:38,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:38,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199224787] [2024-12-02 10:11:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199224787] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:38,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361723623] [2024-12-02 10:11:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:38,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:38,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:38,316 INFO L87 Difference]: Start difference. First operand 3934 states and 5140 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 10:11:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:38,553 INFO L93 Difference]: Finished difference Result 8956 states and 11648 transitions. [2024-12-02 10:11:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 295 [2024-12-02 10:11:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:38,576 INFO L225 Difference]: With dead ends: 8956 [2024-12-02 10:11:38,577 INFO L226 Difference]: Without dead ends: 5306 [2024-12-02 10:11:38,584 INFO L434 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-12-02 10:11:38,584 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 319 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:38,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 731 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2024-12-02 10:11:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4594. [2024-12-02 10:11:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4594 states, 3523 states have (on average 1.2963383479988646) internal successors, (4567), 3635 states have internal predecessors, (4567), 687 states have call successors, (687), 383 states have call predecessors, (687), 383 states have return successors, (687), 583 states have call predecessors, (687), 687 states have call successors, (687) [2024-12-02 10:11:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 5941 transitions. [2024-12-02 10:11:38,794 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 5941 transitions. Word has length 295 [2024-12-02 10:11:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:38,795 INFO L471 AbstractCegarLoop]: Abstraction has 4594 states and 5941 transitions. [2024-12-02 10:11:38,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 10:11:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 5941 transitions. [2024-12-02 10:11:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-02 10:11:38,797 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:38,797 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:38,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 10:11:38,798 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:38,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:38,798 INFO L85 PathProgramCache]: Analyzing trace with hash 517139162, now seen corresponding path program 1 times [2024-12-02 10:11:38,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762272704] [2024-12-02 10:11:38,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-12-02 10:11:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:38,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762272704] [2024-12-02 10:11:38,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762272704] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:38,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:11:38,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974866600] [2024-12-02 10:11:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:38,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:11:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:38,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:11:38,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:38,937 INFO L87 Difference]: Start difference. First operand 4594 states and 5941 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 10:11:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:39,141 INFO L93 Difference]: Finished difference Result 9186 states and 12149 transitions. [2024-12-02 10:11:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:11:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 299 [2024-12-02 10:11:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:39,157 INFO L225 Difference]: With dead ends: 9186 [2024-12-02 10:11:39,158 INFO L226 Difference]: Without dead ends: 5098 [2024-12-02 10:11:39,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:11:39,163 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 32 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:39,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1022 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2024-12-02 10:11:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4990. [2024-12-02 10:11:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3847 states have (on average 1.3108916038471536) internal successors, (5043), 3959 states have internal predecessors, (5043), 759 states have call successors, (759), 383 states have call predecessors, (759), 383 states have return successors, (759), 655 states have call predecessors, (759), 759 states have call successors, (759) [2024-12-02 10:11:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 6561 transitions. [2024-12-02 10:11:39,522 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 6561 transitions. Word has length 299 [2024-12-02 10:11:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 4990 states and 6561 transitions. [2024-12-02 10:11:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 10:11:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 6561 transitions. [2024-12-02 10:11:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-12-02 10:11:39,527 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:39,527 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:11:39,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 10:11:39,527 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1313275818, now seen corresponding path program 1 times [2024-12-02 10:11:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801461136] [2024-12-02 10:11:39,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-12-02 10:11:39,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801461136] [2024-12-02 10:11:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801461136] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:39,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:11:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3526092] [2024-12-02 10:11:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:39,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:11:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:39,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:11:39,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:39,934 INFO L87 Difference]: Start difference. First operand 4990 states and 6561 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 10:11:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:40,106 INFO L93 Difference]: Finished difference Result 9319 states and 12307 transitions. [2024-12-02 10:11:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 299 [2024-12-02 10:11:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:40,117 INFO L225 Difference]: With dead ends: 9319 [2024-12-02 10:11:40,117 INFO L226 Difference]: Without dead ends: 4912 [2024-12-02 10:11:40,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:11:40,121 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:40,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 969 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:11:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4912 states. [2024-12-02 10:11:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4912 to 4912. [2024-12-02 10:11:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4912 states, 3782 states have (on average 1.3088313061872026) internal successors, (4950), 3887 states have internal predecessors, (4950), 753 states have call successors, (753), 377 states have call predecessors, (753), 376 states have return successors, (752), 654 states have call predecessors, (752), 752 states have call successors, (752) [2024-12-02 10:11:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 6455 transitions. [2024-12-02 10:11:40,409 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 6455 transitions. Word has length 299 [2024-12-02 10:11:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:40,409 INFO L471 AbstractCegarLoop]: Abstraction has 4912 states and 6455 transitions. [2024-12-02 10:11:40,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 10:11:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 6455 transitions. [2024-12-02 10:11:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-12-02 10:11:40,412 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:40,412 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:40,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 10:11:40,412 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:40,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1149611780, now seen corresponding path program 1 times [2024-12-02 10:11:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474242320] [2024-12-02 10:11:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-12-02 10:11:40,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474242320] [2024-12-02 10:11:40,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474242320] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:40,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769577085] [2024-12-02 10:11:40,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:40,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:40,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:40,766 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:40,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 10:11:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:40,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-12-02 10:11:40,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-12-02 10:11:41,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-12-02 10:11:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769577085] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:41,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 10:11:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 10] total 17 [2024-12-02 10:11:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856385583] [2024-12-02 10:11:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 10:11:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:41,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 10:11:41,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-12-02 10:11:41,273 INFO L87 Difference]: Start difference. First operand 4912 states and 6455 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-12-02 10:11:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:42,291 INFO L93 Difference]: Finished difference Result 14958 states and 19509 transitions. [2024-12-02 10:11:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 10:11:42,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2024-12-02 10:11:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:42,313 INFO L225 Difference]: With dead ends: 14958 [2024-12-02 10:11:42,314 INFO L226 Difference]: Without dead ends: 10566 [2024-12-02 10:11:42,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2024-12-02 10:11:42,321 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 667 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:42,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 2735 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 10:11:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10566 states. [2024-12-02 10:11:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10566 to 6766. [2024-12-02 10:11:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6766 states, 5182 states have (on average 1.306445387881127) internal successors, (6770), 5332 states have internal predecessors, (6770), 1066 states have call successors, (1066), 518 states have call predecessors, (1066), 517 states have return successors, (1065), 922 states have call predecessors, (1065), 1065 states have call successors, (1065) [2024-12-02 10:11:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6766 states to 6766 states and 8901 transitions. [2024-12-02 10:11:42,750 INFO L78 Accepts]: Start accepts. Automaton has 6766 states and 8901 transitions. Word has length 304 [2024-12-02 10:11:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 6766 states and 8901 transitions. [2024-12-02 10:11:42,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-12-02 10:11:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6766 states and 8901 transitions. [2024-12-02 10:11:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-12-02 10:11:42,753 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:42,754 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:42,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-12-02 10:11:42,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 10:11:42,954 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -474278660, now seen corresponding path program 1 times [2024-12-02 10:11:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670643407] [2024-12-02 10:11:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-12-02 10:11:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670643407] [2024-12-02 10:11:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670643407] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635050097] [2024-12-02 10:11:44,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:44,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:44,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:44,338 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:44,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-12-02 10:11:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:44,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-12-02 10:11:44,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-12-02 10:11:44,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:11:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635050097] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:44,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:11:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 12 [2024-12-02 10:11:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140129493] [2024-12-02 10:11:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:44,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:11:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:44,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:11:44,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-12-02 10:11:44,665 INFO L87 Difference]: Start difference. First operand 6766 states and 8901 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-12-02 10:11:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:45,207 INFO L93 Difference]: Finished difference Result 13102 states and 17221 transitions. [2024-12-02 10:11:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:11:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2024-12-02 10:11:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:45,227 INFO L225 Difference]: With dead ends: 13102 [2024-12-02 10:11:45,227 INFO L226 Difference]: Without dead ends: 6808 [2024-12-02 10:11:45,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-12-02 10:11:45,237 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 122 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:45,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1709 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:11:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2024-12-02 10:11:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 6566. [2024-12-02 10:11:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 5030 states have (on average 1.2982107355864811) internal successors, (6530), 5176 states have internal predecessors, (6530), 1022 states have call successors, (1022), 514 states have call predecessors, (1022), 513 states have return successors, (1021), 882 states have call predecessors, (1021), 1021 states have call successors, (1021) [2024-12-02 10:11:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 8573 transitions. [2024-12-02 10:11:45,633 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 8573 transitions. Word has length 304 [2024-12-02 10:11:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 6566 states and 8573 transitions. [2024-12-02 10:11:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-12-02 10:11:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 8573 transitions. [2024-12-02 10:11:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-12-02 10:11:45,637 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:45,637 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:45,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-12-02 10:11:45,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:45,838 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash 862609092, now seen corresponding path program 1 times [2024-12-02 10:11:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:45,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851394981] [2024-12-02 10:11:45,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-12-02 10:11:46,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:46,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851394981] [2024-12-02 10:11:46,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851394981] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:11:46,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:11:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:11:46,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52771760] [2024-12-02 10:11:46,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:11:46,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:11:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:46,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:11:46,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:11:46,026 INFO L87 Difference]: Start difference. First operand 6566 states and 8573 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-12-02 10:11:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:11:46,559 INFO L93 Difference]: Finished difference Result 11928 states and 15607 transitions. [2024-12-02 10:11:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:11:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 311 [2024-12-02 10:11:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:11:46,571 INFO L225 Difference]: With dead ends: 11928 [2024-12-02 10:11:46,571 INFO L226 Difference]: Without dead ends: 6130 [2024-12-02 10:11:46,577 INFO L434 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-12-02 10:11:46,577 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 432 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 10:11:46,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 886 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 10:11:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2024-12-02 10:11:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 5876. [2024-12-02 10:11:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 4509 states have (on average 1.2789975604346862) internal successors, (5767), 4633 states have internal predecessors, (5767), 907 states have call successors, (907), 459 states have call predecessors, (907), 459 states have return successors, (907), 783 states have call predecessors, (907), 907 states have call successors, (907) [2024-12-02 10:11:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 7581 transitions. [2024-12-02 10:11:47,008 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 7581 transitions. Word has length 311 [2024-12-02 10:11:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:11:47,009 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 7581 transitions. [2024-12-02 10:11:47,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-12-02 10:11:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 7581 transitions. [2024-12-02 10:11:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-12-02 10:11:47,014 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:11:47,014 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:11:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 10:11:47,014 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:11:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:11:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 365093765, now seen corresponding path program 1 times [2024-12-02 10:11:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:11:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035746264] [2024-12-02 10:11:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:11:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-12-02 10:11:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:11:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035746264] [2024-12-02 10:11:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035746264] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:11:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479734694] [2024-12-02 10:11:48,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:11:48,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:11:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:11:48,051 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:11:48,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-12-02 10:11:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:11:48,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-02 10:11:48,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:11:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 211 proven. 122 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-12-02 10:11:49,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:11:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-12-02 10:11:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479734694] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:11:49,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:11:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 34 [2024-12-02 10:11:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030595626] [2024-12-02 10:11:49,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:11:49,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-02 10:11:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:11:49,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-02 10:11:49,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 10:11:49,775 INFO L87 Difference]: Start difference. First operand 5876 states and 7581 transitions. Second operand has 34 states, 33 states have (on average 8.363636363636363) internal successors, (276), 31 states have internal predecessors, (276), 16 states have call successors, (62), 8 states have call predecessors, (62), 10 states have return successors, (61), 17 states have call predecessors, (61), 15 states have call successors, (61) [2024-12-02 10:12:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:12:04,675 INFO L93 Difference]: Finished difference Result 45065 states and 61620 transitions. [2024-12-02 10:12:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2024-12-02 10:12:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 8.363636363636363) internal successors, (276), 31 states have internal predecessors, (276), 16 states have call successors, (62), 8 states have call predecessors, (62), 10 states have return successors, (61), 17 states have call predecessors, (61), 15 states have call successors, (61) Word has length 359 [2024-12-02 10:12:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:12:04,794 INFO L225 Difference]: With dead ends: 45065 [2024-12-02 10:12:04,794 INFO L226 Difference]: Without dead ends: 39965 [2024-12-02 10:12:04,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41229 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7076, Invalid=88714, Unknown=0, NotChecked=0, Total=95790 [2024-12-02 10:12:04,825 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 6343 mSDsluCounter, 15819 mSDsCounter, 0 mSdLazyCounter, 9773 mSolverCounterSat, 1897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6351 SdHoareTripleChecker+Valid, 16778 SdHoareTripleChecker+Invalid, 11670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1897 IncrementalHoareTripleChecker+Valid, 9773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-12-02 10:12:04,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6351 Valid, 16778 Invalid, 11670 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1897 Valid, 9773 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-12-02 10:12:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39965 states. [2024-12-02 10:12:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39965 to 7664. [2024-12-02 10:12:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7664 states, 5912 states have (on average 1.2640392422192153) internal successors, (7473), 6158 states have internal predecessors, (7473), 1138 states have call successors, (1138), 613 states have call predecessors, (1138), 613 states have return successors, (1138), 892 states have call predecessors, (1138), 1138 states have call successors, (1138) [2024-12-02 10:12:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7664 states to 7664 states and 9749 transitions. [2024-12-02 10:12:05,850 INFO L78 Accepts]: Start accepts. Automaton has 7664 states and 9749 transitions. Word has length 359 [2024-12-02 10:12:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:12:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 7664 states and 9749 transitions. [2024-12-02 10:12:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 8.363636363636363) internal successors, (276), 31 states have internal predecessors, (276), 16 states have call successors, (62), 8 states have call predecessors, (62), 10 states have return successors, (61), 17 states have call predecessors, (61), 15 states have call successors, (61) [2024-12-02 10:12:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7664 states and 9749 transitions. [2024-12-02 10:12:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-12-02 10:12:05,857 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:12:05,857 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:05,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-12-02 10:12:06,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:06,058 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:12:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash -668124549, now seen corresponding path program 1 times [2024-12-02 10:12:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820325792] [2024-12-02 10:12:06,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-12-02 10:12:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820325792] [2024-12-02 10:12:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820325792] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:12:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110834549] [2024-12-02 10:12:07,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:07,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:12:07,071 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:12:07,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-12-02 10:12:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:07,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-12-02 10:12:07,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:12:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 211 proven. 120 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-12-02 10:12:08,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:12:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-12-02 10:12:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110834549] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:12:08,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:12:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 39 [2024-12-02 10:12:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439067447] [2024-12-02 10:12:08,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:12:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-12-02 10:12:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:08,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-12-02 10:12:08,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 10:12:08,847 INFO L87 Difference]: Start difference. First operand 7664 states and 9749 transitions. Second operand has 39 states, 38 states have (on average 8.157894736842104) internal successors, (310), 36 states have internal predecessors, (310), 20 states have call successors, (74), 8 states have call predecessors, (74), 10 states have return successors, (73), 21 states have call predecessors, (73), 19 states have call successors, (73) [2024-12-02 10:12:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:12:35,237 INFO L93 Difference]: Finished difference Result 63278 states and 85642 transitions. [2024-12-02 10:12:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 293 states. [2024-12-02 10:12:35,238 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 8.157894736842104) internal successors, (310), 36 states have internal predecessors, (310), 20 states have call successors, (74), 8 states have call predecessors, (74), 10 states have return successors, (73), 21 states have call predecessors, (73), 19 states have call successors, (73) Word has length 360 [2024-12-02 10:12:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:12:35,391 INFO L225 Difference]: With dead ends: 63278 [2024-12-02 10:12:35,391 INFO L226 Difference]: Without dead ends: 56498 [2024-12-02 10:12:35,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46124 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=9348, Invalid=97254, Unknown=0, NotChecked=0, Total=106602 [2024-12-02 10:12:35,419 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 8030 mSDsluCounter, 18247 mSDsCounter, 0 mSdLazyCounter, 12168 mSolverCounterSat, 2532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8030 SdHoareTripleChecker+Valid, 19240 SdHoareTripleChecker+Invalid, 14700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2532 IncrementalHoareTripleChecker+Valid, 12168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-12-02 10:12:35,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8030 Valid, 19240 Invalid, 14700 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2532 Valid, 12168 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-12-02 10:12:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56498 states. [2024-12-02 10:12:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56498 to 8690. [2024-12-02 10:12:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8690 states, 6798 states have (on average 1.2655192703736393) internal successors, (8603), 7114 states have internal predecessors, (8603), 1215 states have call successors, (1215), 676 states have call predecessors, (1215), 676 states have return successors, (1215), 899 states have call predecessors, (1215), 1215 states have call successors, (1215) [2024-12-02 10:12:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8690 states to 8690 states and 11033 transitions. [2024-12-02 10:12:37,496 INFO L78 Accepts]: Start accepts. Automaton has 8690 states and 11033 transitions. Word has length 360 [2024-12-02 10:12:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:12:37,496 INFO L471 AbstractCegarLoop]: Abstraction has 8690 states and 11033 transitions. [2024-12-02 10:12:37,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 8.157894736842104) internal successors, (310), 36 states have internal predecessors, (310), 20 states have call successors, (74), 8 states have call predecessors, (74), 10 states have return successors, (73), 21 states have call predecessors, (73), 19 states have call successors, (73) [2024-12-02 10:12:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8690 states and 11033 transitions. [2024-12-02 10:12:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-12-02 10:12:37,502 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:12:37,503 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:37,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-12-02 10:12:37,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:37,703 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:12:37,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1385929050, now seen corresponding path program 1 times [2024-12-02 10:12:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428146131] [2024-12-02 10:12:37,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 33 proven. 69 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-12-02 10:12:38,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:38,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428146131] [2024-12-02 10:12:38,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428146131] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:12:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694628769] [2024-12-02 10:12:38,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:12:38,856 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:12:38,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-12-02 10:12:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:39,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-12-02 10:12:39,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:12:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 206 proven. 121 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2024-12-02 10:12:39,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:12:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 36 proven. 78 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2024-12-02 10:12:40,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694628769] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:12:40,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:12:40,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 39 [2024-12-02 10:12:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045699958] [2024-12-02 10:12:40,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:12:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-12-02 10:12:40,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:40,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-12-02 10:12:40,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2024-12-02 10:12:40,194 INFO L87 Difference]: Start difference. First operand 8690 states and 11033 transitions. Second operand has 39 states, 35 states have (on average 7.142857142857143) internal successors, (250), 33 states have internal predecessors, (250), 11 states have call successors, (54), 8 states have call predecessors, (54), 18 states have return successors, (58), 12 states have call predecessors, (58), 10 states have call successors, (58) [2024-12-02 10:12:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:12:50,700 INFO L93 Difference]: Finished difference Result 37277 states and 48245 transitions. [2024-12-02 10:12:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-02 10:12:50,700 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 7.142857142857143) internal successors, (250), 33 states have internal predecessors, (250), 11 states have call successors, (54), 8 states have call predecessors, (54), 18 states have return successors, (58), 12 states have call predecessors, (58), 10 states have call successors, (58) Word has length 361 [2024-12-02 10:12:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:12:50,762 INFO L225 Difference]: With dead ends: 37277 [2024-12-02 10:12:50,762 INFO L226 Difference]: Without dead ends: 29127 [2024-12-02 10:12:50,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1571, Invalid=8529, Unknown=0, NotChecked=0, Total=10100 [2024-12-02 10:12:50,777 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 1911 mSDsluCounter, 7997 mSDsCounter, 0 mSdLazyCounter, 6191 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 8610 SdHoareTripleChecker+Invalid, 6980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 6191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 10:12:50,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1911 Valid, 8610 Invalid, 6980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [789 Valid, 6191 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 10:12:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29127 states. [2024-12-02 10:12:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29127 to 17760. [2024-12-02 10:12:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17760 states, 13922 states have (on average 1.2668438442752479) internal successors, (17637), 14553 states have internal predecessors, (17637), 2501 states have call successors, (2501), 1328 states have call predecessors, (2501), 1336 states have return successors, (2517), 1878 states have call predecessors, (2517), 2501 states have call successors, (2517) [2024-12-02 10:12:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17760 states to 17760 states and 22655 transitions. [2024-12-02 10:12:53,990 INFO L78 Accepts]: Start accepts. Automaton has 17760 states and 22655 transitions. Word has length 361 [2024-12-02 10:12:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:12:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 17760 states and 22655 transitions. [2024-12-02 10:12:53,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 7.142857142857143) internal successors, (250), 33 states have internal predecessors, (250), 11 states have call successors, (54), 8 states have call predecessors, (54), 18 states have return successors, (58), 12 states have call predecessors, (58), 10 states have call successors, (58) [2024-12-02 10:12:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17760 states and 22655 transitions. [2024-12-02 10:12:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-12-02 10:12:54,006 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:12:54,006 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:12:54,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-12-02 10:12:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:12:54,207 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:12:54,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:12:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1189415545, now seen corresponding path program 1 times [2024-12-02 10:12:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:12:54,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69038078] [2024-12-02 10:12:54,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:12:54,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:12:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:12:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2024-12-02 10:12:54,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:12:54,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69038078] [2024-12-02 10:12:54,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69038078] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:12:54,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:12:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:12:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383863246] [2024-12-02 10:12:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:12:54,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:12:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:12:54,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:12:54,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:12:54,316 INFO L87 Difference]: Start difference. First operand 17760 states and 22655 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-12-02 10:12:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:12:57,763 INFO L93 Difference]: Finished difference Result 36009 states and 45841 transitions. [2024-12-02 10:12:57,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:12:57,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 361 [2024-12-02 10:12:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:12:57,804 INFO L225 Difference]: With dead ends: 36009 [2024-12-02 10:12:57,804 INFO L226 Difference]: Without dead ends: 17728 [2024-12-02 10:12:57,831 INFO L434 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-12-02 10:12:57,832 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 26 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:12:57,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 670 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:12:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17728 states. [2024-12-02 10:13:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17728 to 17728. [2024-12-02 10:13:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17728 states, 13898 states have (on average 1.247517628435746) internal successors, (17338), 14529 states have internal predecessors, (17338), 2501 states have call successors, (2501), 1328 states have call predecessors, (2501), 1328 states have return successors, (2501), 1870 states have call predecessors, (2501), 2501 states have call successors, (2501) [2024-12-02 10:13:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17728 states to 17728 states and 22340 transitions. [2024-12-02 10:13:00,938 INFO L78 Accepts]: Start accepts. Automaton has 17728 states and 22340 transitions. Word has length 361 [2024-12-02 10:13:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:13:00,938 INFO L471 AbstractCegarLoop]: Abstraction has 17728 states and 22340 transitions. [2024-12-02 10:13:00,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-12-02 10:13:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17728 states and 22340 transitions. [2024-12-02 10:13:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-12-02 10:13:00,957 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:13:00,957 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:13:00,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 10:13:00,957 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:13:00,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash 962227870, now seen corresponding path program 1 times [2024-12-02 10:13:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793892094] [2024-12-02 10:13:00,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 49 proven. 193 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-12-02 10:13:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793892094] [2024-12-02 10:13:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793892094] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:13:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597076367] [2024-12-02 10:13:02,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:02,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:02,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:13:02,457 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:13:02,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-12-02 10:13:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:02,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 10:13:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:13:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 142 proven. 3 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-12-02 10:13:02,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:13:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-12-02 10:13:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597076367] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:13:03,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:13:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 38 [2024-12-02 10:13:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077268155] [2024-12-02 10:13:03,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:13:03,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 10:13:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:03,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 10:13:03,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1302, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 10:13:03,438 INFO L87 Difference]: Start difference. First operand 17728 states and 22340 transitions. Second operand has 38 states, 34 states have (on average 6.294117647058823) internal successors, (214), 31 states have internal predecessors, (214), 12 states have call successors, (52), 6 states have call predecessors, (52), 11 states have return successors, (52), 13 states have call predecessors, (52), 11 states have call successors, (52) [2024-12-02 10:13:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:13:13,849 INFO L93 Difference]: Finished difference Result 51205 states and 67038 transitions. [2024-12-02 10:13:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-12-02 10:13:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 6.294117647058823) internal successors, (214), 31 states have internal predecessors, (214), 12 states have call successors, (52), 6 states have call predecessors, (52), 11 states have return successors, (52), 13 states have call predecessors, (52), 11 states have call successors, (52) Word has length 361 [2024-12-02 10:13:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:13:13,932 INFO L225 Difference]: With dead ends: 51205 [2024-12-02 10:13:13,932 INFO L226 Difference]: Without dead ends: 34379 [2024-12-02 10:13:13,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2478 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=808, Invalid=9092, Unknown=0, NotChecked=0, Total=9900 [2024-12-02 10:13:13,956 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1808 mSDsluCounter, 5945 mSDsCounter, 0 mSdLazyCounter, 5057 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 5851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 5057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 10:13:13,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 6220 Invalid, 5851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 5057 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 10:13:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34379 states. [2024-12-02 10:13:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34379 to 20437. [2024-12-02 10:13:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20437 states, 15919 states have (on average 1.234688108549532) internal successors, (19655), 16633 states have internal predecessors, (19655), 2952 states have call successors, (2952), 1563 states have call predecessors, (2952), 1565 states have return successors, (2956), 2240 states have call predecessors, (2956), 2952 states have call successors, (2956) [2024-12-02 10:13:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20437 states to 20437 states and 25563 transitions. [2024-12-02 10:13:18,306 INFO L78 Accepts]: Start accepts. Automaton has 20437 states and 25563 transitions. Word has length 361 [2024-12-02 10:13:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:13:18,306 INFO L471 AbstractCegarLoop]: Abstraction has 20437 states and 25563 transitions. [2024-12-02 10:13:18,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 6.294117647058823) internal successors, (214), 31 states have internal predecessors, (214), 12 states have call successors, (52), 6 states have call predecessors, (52), 11 states have return successors, (52), 13 states have call predecessors, (52), 11 states have call successors, (52) [2024-12-02 10:13:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20437 states and 25563 transitions. [2024-12-02 10:13:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-12-02 10:13:18,328 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:13:18,328 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:13:18,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-12-02 10:13:18,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:18,529 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:13:18,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1238706827, now seen corresponding path program 1 times [2024-12-02 10:13:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454691631] [2024-12-02 10:13:18,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2024-12-02 10:13:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454691631] [2024-12-02 10:13:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454691631] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:13:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990306208] [2024-12-02 10:13:18,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:18,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:13:18,628 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:13:18,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-12-02 10:13:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:18,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:13:18,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:13:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2024-12-02 10:13:18,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:13:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990306208] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:13:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:13:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-12-02 10:13:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310264412] [2024-12-02 10:13:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:13:18,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:13:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:18,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:13:18,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:13:18,877 INFO L87 Difference]: Start difference. First operand 20437 states and 25563 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-12-02 10:13:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:13:22,483 INFO L93 Difference]: Finished difference Result 40090 states and 50220 transitions. [2024-12-02 10:13:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:13:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 374 [2024-12-02 10:13:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:13:22,530 INFO L225 Difference]: With dead ends: 40090 [2024-12-02 10:13:22,530 INFO L226 Difference]: Without dead ends: 19654 [2024-12-02 10:13:22,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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-12-02 10:13:22,551 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 18 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:13:22,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 669 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:13:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2024-12-02 10:13:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 19418. [2024-12-02 10:13:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19418 states, 15119 states have (on average 1.238177128116939) internal successors, (18720), 15802 states have internal predecessors, (18720), 2821 states have call successors, (2821), 1477 states have call predecessors, (2821), 1477 states have return successors, (2821), 2138 states have call predecessors, (2821), 2821 states have call successors, (2821) [2024-12-02 10:13:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19418 states to 19418 states and 24362 transitions. [2024-12-02 10:13:26,218 INFO L78 Accepts]: Start accepts. Automaton has 19418 states and 24362 transitions. Word has length 374 [2024-12-02 10:13:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:13:26,218 INFO L471 AbstractCegarLoop]: Abstraction has 19418 states and 24362 transitions. [2024-12-02 10:13:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-12-02 10:13:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19418 states and 24362 transitions. [2024-12-02 10:13:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-12-02 10:13:26,245 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:13:26,245 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:13:26,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-12-02 10:13:26,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:26,446 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:13:26,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash 557378052, now seen corresponding path program 1 times [2024-12-02 10:13:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:26,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992238731] [2024-12-02 10:13:26,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 58 proven. 52 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-12-02 10:13:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992238731] [2024-12-02 10:13:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992238731] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:13:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800632041] [2024-12-02 10:13:27,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:13:27,607 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:13:27,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-12-02 10:13:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:27,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-02 10:13:27,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:13:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 319 proven. 122 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-12-02 10:13:28,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:13:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 61 proven. 61 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2024-12-02 10:13:28,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800632041] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:13:28,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:13:28,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 38 [2024-12-02 10:13:28,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949531696] [2024-12-02 10:13:28,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:13:28,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 10:13:28,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:28,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 10:13:28,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 10:13:28,859 INFO L87 Difference]: Start difference. First operand 19418 states and 24362 transitions. Second operand has 38 states, 35 states have (on average 7.857142857142857) internal successors, (275), 32 states have internal predecessors, (275), 10 states have call successors, (62), 8 states have call predecessors, (62), 18 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2024-12-02 10:13:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:13:46,432 INFO L93 Difference]: Finished difference Result 79915 states and 101816 transitions. [2024-12-02 10:13:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-12-02 10:13:46,433 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 7.857142857142857) internal successors, (275), 32 states have internal predecessors, (275), 10 states have call successors, (62), 8 states have call predecessors, (62), 18 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) Word has length 381 [2024-12-02 10:13:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:13:46,591 INFO L225 Difference]: With dead ends: 79915 [2024-12-02 10:13:46,592 INFO L226 Difference]: Without dead ends: 61317 [2024-12-02 10:13:46,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1533, Invalid=7973, Unknown=0, NotChecked=0, Total=9506 [2024-12-02 10:13:46,624 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 1492 mSDsluCounter, 10180 mSDsCounter, 0 mSdLazyCounter, 6215 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 10832 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 6215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 10:13:46,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 10832 Invalid, 6784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 6215 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 10:13:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61317 states. [2024-12-02 10:13:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61317 to 38374. [2024-12-02 10:13:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38374 states, 29763 states have (on average 1.230857104458556) internal successors, (36634), 31032 states have internal predecessors, (36634), 5673 states have call successors, (5673), 2937 states have call predecessors, (5673), 2937 states have return successors, (5673), 4404 states have call predecessors, (5673), 5673 states have call successors, (5673) [2024-12-02 10:13:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 47980 transitions. [2024-12-02 10:13:54,951 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 47980 transitions. Word has length 381 [2024-12-02 10:13:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:13:54,951 INFO L471 AbstractCegarLoop]: Abstraction has 38374 states and 47980 transitions. [2024-12-02 10:13:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 7.857142857142857) internal successors, (275), 32 states have internal predecessors, (275), 10 states have call successors, (62), 8 states have call predecessors, (62), 18 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2024-12-02 10:13:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 47980 transitions. [2024-12-02 10:13:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-12-02 10:13:55,012 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:13:55,013 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:13:55,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-12-02 10:13:55,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-12-02 10:13:55,213 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:13:55,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:13:55,213 INFO L85 PathProgramCache]: Analyzing trace with hash 618897192, now seen corresponding path program 1 times [2024-12-02 10:13:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:13:55,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747984150] [2024-12-02 10:13:55,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:13:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 99 proven. 177 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2024-12-02 10:13:56,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:13:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747984150] [2024-12-02 10:13:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747984150] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:13:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068416842] [2024-12-02 10:13:56,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:13:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:13:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:13:56,662 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:13:56,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-12-02 10:13:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:13:56,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 10:13:56,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:13:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-12-02 10:13:56,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:13:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068416842] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:13:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:13:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2024-12-02 10:13:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854050417] [2024-12-02 10:13:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:13:56,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:13:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:13:56,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:13:56,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-12-02 10:13:56,972 INFO L87 Difference]: Start difference. First operand 38374 states and 47980 transitions. Second operand has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-12-02 10:14:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:14:02,897 INFO L93 Difference]: Finished difference Result 64129 states and 79982 transitions. [2024-12-02 10:14:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:14:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 381 [2024-12-02 10:14:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:14:02,971 INFO L225 Difference]: With dead ends: 64129 [2024-12-02 10:14:02,972 INFO L226 Difference]: Without dead ends: 26520 [2024-12-02 10:14:03,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-12-02 10:14:03,011 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:14:03,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 931 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:14:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26520 states. [2024-12-02 10:14:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26520 to 24240. [2024-12-02 10:14:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24240 states, 18756 states have (on average 1.2146513115802944) internal successors, (22782), 19455 states have internal predecessors, (22782), 3568 states have call successors, (3568), 1915 states have call predecessors, (3568), 1915 states have return successors, (3568), 2869 states have call predecessors, (3568), 3568 states have call successors, (3568) [2024-12-02 10:14:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24240 states to 24240 states and 29918 transitions. [2024-12-02 10:14:08,338 INFO L78 Accepts]: Start accepts. Automaton has 24240 states and 29918 transitions. Word has length 381 [2024-12-02 10:14:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:14:08,338 INFO L471 AbstractCegarLoop]: Abstraction has 24240 states and 29918 transitions. [2024-12-02 10:14:08,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.25) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-12-02 10:14:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 24240 states and 29918 transitions. [2024-12-02 10:14:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-12-02 10:14:08,360 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:14:08,360 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:14:08,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-12-02 10:14:08,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-12-02 10:14:08,560 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:14:08,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:14:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -954052756, now seen corresponding path program 1 times [2024-12-02 10:14:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:14:08,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799898186] [2024-12-02 10:14:08,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:14:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:14:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:14:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 93 proven. 177 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2024-12-02 10:14:09,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:14:09,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799898186] [2024-12-02 10:14:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799898186] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:14:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680739596] [2024-12-02 10:14:09,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:14:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:14:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:14:09,871 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:14:09,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-12-02 10:14:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:14:10,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 10:14:10,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:14:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 337 proven. 86 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-12-02 10:14:10,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:14:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-12-02 10:14:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680739596] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:14:10,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:14:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 9] total 27 [2024-12-02 10:14:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584966112] [2024-12-02 10:14:10,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:14:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-12-02 10:14:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:14:10,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-12-02 10:14:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2024-12-02 10:14:10,411 INFO L87 Difference]: Start difference. First operand 24240 states and 29918 transitions. Second operand has 27 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 10 states have call successors, (54), 5 states have call predecessors, (54), 9 states have return successors, (53), 10 states have call predecessors, (53), 9 states have call successors, (53) [2024-12-02 10:14:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:14:18,336 INFO L93 Difference]: Finished difference Result 48520 states and 62299 transitions. [2024-12-02 10:14:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-12-02 10:14:18,336 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 10 states have call successors, (54), 5 states have call predecessors, (54), 9 states have return successors, (53), 10 states have call predecessors, (53), 9 states have call successors, (53) Word has length 382 [2024-12-02 10:14:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:14:18,399 INFO L225 Difference]: With dead ends: 48520 [2024-12-02 10:14:18,399 INFO L226 Difference]: Without dead ends: 24756 [2024-12-02 10:14:18,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 827 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=3503, Unknown=0, NotChecked=0, Total=3906 [2024-12-02 10:14:18,423 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1011 mSDsluCounter, 4255 mSDsCounter, 0 mSdLazyCounter, 3031 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 4493 SdHoareTripleChecker+Invalid, 3419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 3031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 10:14:18,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 4493 Invalid, 3419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 3031 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 10:14:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24756 states. [2024-12-02 10:14:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24756 to 15320. [2024-12-02 10:14:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15320 states, 11884 states have (on average 1.2013631773813531) internal successors, (14277), 12236 states have internal predecessors, (14277), 2206 states have call successors, (2206), 1229 states have call predecessors, (2206), 1229 states have return successors, (2206), 1854 states have call predecessors, (2206), 2206 states have call successors, (2206) [2024-12-02 10:14:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15320 states to 15320 states and 18689 transitions. [2024-12-02 10:14:22,069 INFO L78 Accepts]: Start accepts. Automaton has 15320 states and 18689 transitions. Word has length 382 [2024-12-02 10:14:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:14:22,069 INFO L471 AbstractCegarLoop]: Abstraction has 15320 states and 18689 transitions. [2024-12-02 10:14:22,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 10 states have call successors, (54), 5 states have call predecessors, (54), 9 states have return successors, (53), 10 states have call predecessors, (53), 9 states have call successors, (53) [2024-12-02 10:14:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15320 states and 18689 transitions. [2024-12-02 10:14:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-12-02 10:14:22,082 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:14:22,083 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:14:22,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-12-02 10:14:22,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-12-02 10:14:22,283 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:14:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:14:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 669850735, now seen corresponding path program 1 times [2024-12-02 10:14:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:14:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315152735] [2024-12-02 10:14:22,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:14:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:14:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:14:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2024-12-02 10:14:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:14:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315152735] [2024-12-02 10:14:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315152735] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:14:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409152014] [2024-12-02 10:14:22,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:14:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:14:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:14:22,500 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:14:22,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-12-02 10:14:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:14:22,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:14:22,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:14:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 127 proven. 341 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 10:14:23,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:14:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2024-12-02 10:14:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409152014] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:14:23,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:14:23,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 19 [2024-12-02 10:14:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914169965] [2024-12-02 10:14:23,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:14:23,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 10:14:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:14:23,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 10:14:23,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-12-02 10:14:23,448 INFO L87 Difference]: Start difference. First operand 15320 states and 18689 transitions. Second operand has 19 states, 19 states have (on average 15.368421052631579) internal successors, (292), 17 states have internal predecessors, (292), 7 states have call successors, (86), 6 states have call predecessors, (86), 9 states have return successors, (85), 9 states have call predecessors, (85), 7 states have call successors, (85) [2024-12-02 10:14:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:14:35,811 INFO L93 Difference]: Finished difference Result 52479 states and 64010 transitions. [2024-12-02 10:14:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-12-02 10:14:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.368421052631579) internal successors, (292), 17 states have internal predecessors, (292), 7 states have call successors, (86), 6 states have call predecessors, (86), 9 states have return successors, (85), 9 states have call predecessors, (85), 7 states have call successors, (85) Word has length 398 [2024-12-02 10:14:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:14:35,887 INFO L225 Difference]: With dead ends: 52479 [2024-12-02 10:14:35,887 INFO L226 Difference]: Without dead ends: 38051 [2024-12-02 10:14:35,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 792 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=6140, Unknown=0, NotChecked=0, Total=6806 [2024-12-02 10:14:35,904 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1507 mSDsluCounter, 5870 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 6383 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:14:35,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 6383 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 10:14:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38051 states. [2024-12-02 10:14:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38051 to 29007. [2024-12-02 10:14:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29007 states, 22546 states have (on average 1.1935154794642064) internal successors, (26909), 23223 states have internal predecessors, (26909), 4112 states have call successors, (4112), 2348 states have call predecessors, (4112), 2348 states have return successors, (4112), 3435 states have call predecessors, (4112), 4112 states have call successors, (4112) [2024-12-02 10:14:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29007 states to 29007 states and 35133 transitions. [2024-12-02 10:14:43,080 INFO L78 Accepts]: Start accepts. Automaton has 29007 states and 35133 transitions. Word has length 398 [2024-12-02 10:14:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:14:43,081 INFO L471 AbstractCegarLoop]: Abstraction has 29007 states and 35133 transitions. [2024-12-02 10:14:43,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.368421052631579) internal successors, (292), 17 states have internal predecessors, (292), 7 states have call successors, (86), 6 states have call predecessors, (86), 9 states have return successors, (85), 9 states have call predecessors, (85), 7 states have call successors, (85) [2024-12-02 10:14:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29007 states and 35133 transitions. [2024-12-02 10:14:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-12-02 10:14:43,096 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:14:43,096 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:14:43,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-12-02 10:14:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-12-02 10:14:43,296 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:14:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:14:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 204884279, now seen corresponding path program 1 times [2024-12-02 10:14:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:14:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536706952] [2024-12-02 10:14:43,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:14:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:14:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:14:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2024-12-02 10:14:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:14:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536706952] [2024-12-02 10:14:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536706952] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:14:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785683527] [2024-12-02 10:14:43,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:14:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:14:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:14:43,542 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:14:43,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-12-02 10:14:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:14:43,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-12-02 10:14:43,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:14:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 462 proven. 90 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2024-12-02 10:14:44,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:14:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2024-12-02 10:14:44,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785683527] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:14:44,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:14:44,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 16] total 37 [2024-12-02 10:14:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096412320] [2024-12-02 10:14:44,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:14:44,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-12-02 10:14:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:14:44,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-12-02 10:14:44,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2024-12-02 10:14:44,823 INFO L87 Difference]: Start difference. First operand 29007 states and 35133 transitions. Second operand has 37 states, 34 states have (on average 8.823529411764707) internal successors, (300), 32 states have internal predecessors, (300), 10 states have call successors, (65), 8 states have call predecessors, (65), 17 states have return successors, (66), 12 states have call predecessors, (66), 10 states have call successors, (66) [2024-12-02 10:15:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:15:03,506 INFO L93 Difference]: Finished difference Result 67718 states and 81765 transitions. [2024-12-02 10:15:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-12-02 10:15:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 8.823529411764707) internal successors, (300), 32 states have internal predecessors, (300), 10 states have call successors, (65), 8 states have call predecessors, (65), 17 states have return successors, (66), 12 states have call predecessors, (66), 10 states have call successors, (66) Word has length 401 [2024-12-02 10:15:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:15:03,719 INFO L225 Difference]: With dead ends: 67718 [2024-12-02 10:15:03,719 INFO L226 Difference]: Without dead ends: 39419 [2024-12-02 10:15:03,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10381 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3617, Invalid=28603, Unknown=0, NotChecked=0, Total=32220 [2024-12-02 10:15:03,749 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 2766 mSDsluCounter, 8726 mSDsCounter, 0 mSdLazyCounter, 7572 mSolverCounterSat, 1118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2767 SdHoareTripleChecker+Valid, 9237 SdHoareTripleChecker+Invalid, 8690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1118 IncrementalHoareTripleChecker+Valid, 7572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-12-02 10:15:03,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2767 Valid, 9237 Invalid, 8690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1118 Valid, 7572 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-12-02 10:15:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39419 states. [2024-12-02 10:15:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39419 to 25858. [2024-12-02 10:15:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25858 states, 20125 states have (on average 1.172223602484472) internal successors, (23591), 20622 states have internal predecessors, (23591), 3548 states have call successors, (3548), 2184 states have call predecessors, (3548), 2184 states have return successors, (3548), 3051 states have call predecessors, (3548), 3548 states have call successors, (3548) [2024-12-02 10:15:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25858 states to 25858 states and 30687 transitions. [2024-12-02 10:15:11,100 INFO L78 Accepts]: Start accepts. Automaton has 25858 states and 30687 transitions. Word has length 401 [2024-12-02 10:15:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:15:11,101 INFO L471 AbstractCegarLoop]: Abstraction has 25858 states and 30687 transitions. [2024-12-02 10:15:11,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 8.823529411764707) internal successors, (300), 32 states have internal predecessors, (300), 10 states have call successors, (65), 8 states have call predecessors, (65), 17 states have return successors, (66), 12 states have call predecessors, (66), 10 states have call successors, (66) [2024-12-02 10:15:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25858 states and 30687 transitions. [2024-12-02 10:15:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-12-02 10:15:11,114 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:15:11,115 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:15:11,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-12-02 10:15:11,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-12-02 10:15:11,315 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:15:11,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:15:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1302933237, now seen corresponding path program 1 times [2024-12-02 10:15:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:15:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94501463] [2024-12-02 10:15:11,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:15:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:15:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:15:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 141 proven. 137 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-12-02 10:15:12,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:15:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94501463] [2024-12-02 10:15:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94501463] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:15:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770674339] [2024-12-02 10:15:12,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:15:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:15:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:15:12,660 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:15:12,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-12-02 10:15:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:15:12,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-12-02 10:15:12,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:15:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 488 proven. 303 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-12-02 10:15:13,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:15:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 166 proven. 137 refuted. 0 times theorem prover too weak. 878 trivial. 0 not checked. [2024-12-02 10:15:14,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770674339] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:15:14,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:15:14,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 22] total 50 [2024-12-02 10:15:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440439205] [2024-12-02 10:15:14,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:15:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-12-02 10:15:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:15:14,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-12-02 10:15:14,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2221, Unknown=0, NotChecked=0, Total=2450 [2024-12-02 10:15:14,638 INFO L87 Difference]: Start difference. First operand 25858 states and 30687 transitions. Second operand has 50 states, 47 states have (on average 7.808510638297872) internal successors, (367), 42 states have internal predecessors, (367), 16 states have call successors, (75), 9 states have call predecessors, (75), 21 states have return successors, (77), 19 states have call predecessors, (77), 15 states have call successors, (77) [2024-12-02 10:15:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:15:32,598 INFO L93 Difference]: Finished difference Result 70858 states and 87073 transitions. [2024-12-02 10:15:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-12-02 10:15:32,599 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 7.808510638297872) internal successors, (367), 42 states have internal predecessors, (367), 16 states have call successors, (75), 9 states have call predecessors, (75), 21 states have return successors, (77), 19 states have call predecessors, (77), 15 states have call successors, (77) Word has length 403 [2024-12-02 10:15:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:15:32,704 INFO L225 Difference]: With dead ends: 70858 [2024-12-02 10:15:32,704 INFO L226 Difference]: Without dead ends: 45748 [2024-12-02 10:15:32,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 791 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4511 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1638, Invalid=14112, Unknown=0, NotChecked=0, Total=15750 [2024-12-02 10:15:32,735 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 2309 mSDsluCounter, 8185 mSDsCounter, 0 mSdLazyCounter, 5657 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 8534 SdHoareTripleChecker+Invalid, 6661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 5657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-12-02 10:15:32,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 8534 Invalid, 6661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 5657 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-12-02 10:15:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45748 states. [2024-12-02 10:15:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45748 to 32591. [2024-12-02 10:15:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32591 states, 25097 states have (on average 1.161692632585568) internal successors, (29155), 25748 states have internal predecessors, (29155), 4652 states have call successors, (4652), 2841 states have call predecessors, (4652), 2841 states have return successors, (4652), 4001 states have call predecessors, (4652), 4652 states have call successors, (4652) [2024-12-02 10:15:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32591 states to 32591 states and 38459 transitions. [2024-12-02 10:15:41,866 INFO L78 Accepts]: Start accepts. Automaton has 32591 states and 38459 transitions. Word has length 403 [2024-12-02 10:15:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:15:41,866 INFO L471 AbstractCegarLoop]: Abstraction has 32591 states and 38459 transitions. [2024-12-02 10:15:41,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 7.808510638297872) internal successors, (367), 42 states have internal predecessors, (367), 16 states have call successors, (75), 9 states have call predecessors, (75), 21 states have return successors, (77), 19 states have call predecessors, (77), 15 states have call successors, (77) [2024-12-02 10:15:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states and 38459 transitions. [2024-12-02 10:15:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-12-02 10:15:41,891 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:15:41,891 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:15:41,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-12-02 10:15:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:15:42,093 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 10:15:42,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:15:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash 116559234, now seen corresponding path program 1 times [2024-12-02 10:15:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:15:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83337946] [2024-12-02 10:15:42,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:15:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:15:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:15:42,229 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:15:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:15:42,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 10:15:42,409 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 10:15:42,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 10:15:42,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-02 10:15:42,413 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2024-12-02 10:15:42,578 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 10:15:42,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:15:42 BoogieIcfgContainer [2024-12-02 10:15:42,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 10:15:42,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 10:15:42,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 10:15:42,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 10:15:42,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:11:17" (3/4) ... [2024-12-02 10:15:42,582 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 10:15:42,767 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 301. [2024-12-02 10:15:42,895 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 10:15:42,896 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 10:15:42,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 10:15:42,897 INFO L158 Benchmark]: Toolchain (without parser) took 266312.91ms. Allocated memory was 142.6MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 117.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-12-02 10:15:42,897 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:15:42,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.86ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 100.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 10:15:42,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.98ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 97.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:15:42,898 INFO L158 Benchmark]: Boogie Preprocessor took 54.33ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 94.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 10:15:42,898 INFO L158 Benchmark]: RCFGBuilder took 727.76ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 57.4MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-02 10:15:42,898 INFO L158 Benchmark]: TraceAbstraction took 264846.36ms. Allocated memory was 142.6MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 56.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-12-02 10:15:42,898 INFO L158 Benchmark]: Witness Printer took 315.32ms. Allocated memory is still 4.8GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-12-02 10:15:42,899 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.86ms. Allocated memory is still 142.6MB. Free memory was 117.5MB in the beginning and 100.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.98ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 97.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.33ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 94.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 727.76ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 57.4MB in the end (delta: 36.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 264846.36ms. Allocated memory was 142.6MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 56.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 315.32ms. Allocated memory is still 4.8GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. 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: 537]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L502] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] CALL, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] RET, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] CALL, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] RET, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] CALL, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] RET, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] CALL, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] RET, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L502] RET, EXPR init() [L502] i2 = init() [L503] CALL assume_abort_if_not(i2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L503] RET assume_abort_if_not(i2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] i2 = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L347] RET write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=1, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L409] RET write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] RET assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND FALSE !(! gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L258] COND TRUE ! gate3Failed [L259] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=2, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=2, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=3, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=3, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L297] COND FALSE !(! (temp_count > 1)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L336] return (1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L535] COND FALSE !(! arg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L524] RET assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L347] RET write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] RET assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L409] RET write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L410] COND TRUE \read(gate3Failed) [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND FALSE !(! tmp___3) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] COND TRUE ! arg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L537] reach_error() VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 264.6s, OverallIterations: 52, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 157.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30810 SdHoareTripleChecker+Valid, 35.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30642 mSDsluCounter, 130830 SdHoareTripleChecker+Invalid, 29.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114063 mSDsCounter, 9946 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60981 IncrementalHoareTripleChecker+Invalid, 70927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9946 mSolverCounterUnsat, 16767 mSDtfsCounter, 60981 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15083 GetRequests, 13450 SyntacticMatches, 16 SemanticMatches, 1617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112696 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38374occurred in iteration=46, InterpolantAutomatonStates: 1342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.7s AutomataMinimizationTime, 51 MinimizatonAttempts, 182477 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 20753 NumberOfCodeBlocks, 20604 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 24704 ConstructedInterpolants, 0 QuantifiedInterpolants, 45606 SizeOfPredicates, 71 NumberOfNonLiveVariables, 33143 ConjunctsInSsa, 542 ConjunctsInUnsatCore, 99 InterpolantComputations, 39 PerfectInterpolantSequences, 54514/57577 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-12-02 10:15:42,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77b1fd64-adef-4dbd-a2dc-c723462a21d7/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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