./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.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_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB --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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:14:56,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:14:56,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:14:56,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:14:56,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:14:56,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:14:56,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:14:56,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:14:56,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:14:56,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:14:56,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:14:56,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:14:56,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:14:56,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:14:56,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:14:56,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:14:56,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:14:56,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:14:56,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:14:56,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:14:56,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:14:56,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:14:56,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:14:56,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:14:56,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:14:56,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:14:56,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:14:56,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:14:56,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:14:56,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:14:56,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:14:56,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:14:56,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:14:56,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:14:56,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:14:56,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:14:56,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:14:56,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:14:56,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:14:56,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:14:56,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:14:56,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:14:56,784 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_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2024-11-28 03:14:57,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:14:57,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:14:57,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:14:57,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:14:57,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:14:57,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-28 03:15:00,271 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/data/884bbe91e/f0e455c269714b3098bcd24ab8c2d26d/FLAG33122eef6 [2024-11-28 03:15:00,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:15:00,667 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-28 03:15:00,678 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/data/884bbe91e/f0e455c269714b3098bcd24ab8c2d26d/FLAG33122eef6 [2024-11-28 03:15:00,696 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/data/884bbe91e/f0e455c269714b3098bcd24ab8c2d26d [2024-11-28 03:15:00,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:15:00,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:15:00,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:15:00,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:15:00,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:15:00,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:00" (1/1) ... [2024-11-28 03:15:00,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d53ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:00, skipping insertion in model container [2024-11-28 03:15:00,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:00" (1/1) ... [2024-11-28 03:15:00,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:15:01,111 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_1db7db38-0bc1-4e30-ab0b-c1e90853675f/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2024-11-28 03:15:01,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:15:01,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:15:01,244 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_1db7db38-0bc1-4e30-ab0b-c1e90853675f/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2024-11-28 03:15:01,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:15:01,266 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:15:01,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01 WrapperNode [2024-11-28 03:15:01,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:15:01,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:15:01,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:15:01,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:15:01,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,370 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 426 [2024-11-28 03:15:01,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:15:01,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:15:01,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:15:01,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:15:01,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,433 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-11-28 03:15:01,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:15:01,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:15:01,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:15:01,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:15:01,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (1/1) ... [2024-11-28 03:15:01,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:15:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:01,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:15:01,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:15:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:15:01,564 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-28 03:15:01,565 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-28 03:15:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-28 03:15:01,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-28 03:15:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-28 03:15:01,565 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-28 03:15:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-28 03:15:01,565 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-28 03:15:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-28 03:15:01,566 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-28 03:15:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:15:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:15:01,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:15:01,728 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:15:01,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:15:02,662 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-28 03:15:02,666 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:15:02,689 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:15:02,689 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:15:02,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:02 BoogieIcfgContainer [2024-11-28 03:15:02,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:15:02,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:15:02,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:15:02,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:15:02,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:15:00" (1/3) ... [2024-11-28 03:15:02,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc53852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:15:02, skipping insertion in model container [2024-11-28 03:15:02,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:01" (2/3) ... [2024-11-28 03:15:02,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc53852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:15:02, skipping insertion in model container [2024-11-28 03:15:02,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:02" (3/3) ... [2024-11-28 03:15:02,706 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2024-11-28 03:15:02,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:15:02,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c that has 6 procedures, 176 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 03:15:02,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:15:02,847 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;@382f97fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:15:02,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:15:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 137 states have (on average 1.5985401459854014) internal successors, (219), 141 states have internal predecessors, (219), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 03:15:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 03:15:02,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:02,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:02,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:02,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash -155480943, now seen corresponding path program 1 times [2024-11-28 03:15:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922521000] [2024-11-28 03:15:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:03,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922521000] [2024-11-28 03:15:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922521000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454155027] [2024-11-28 03:15:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:03,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:03,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:03,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:03,406 INFO L87 Difference]: Start difference. First operand has 176 states, 137 states have (on average 1.5985401459854014) internal successors, (219), 141 states have internal predecessors, (219), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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-11-28 03:15:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:03,585 INFO L93 Difference]: Finished difference Result 355 states and 602 transitions. [2024-11-28 03:15:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:03,592 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-11-28 03:15:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:03,611 INFO L225 Difference]: With dead ends: 355 [2024-11-28 03:15:03,611 INFO L226 Difference]: Without dead ends: 178 [2024-11-28 03:15:03,620 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-11-28 03:15:03,625 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 7 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 797 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:03,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 797 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-28 03:15:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-28 03:15:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.539568345323741) internal successors, (214), 142 states have internal predecessors, (214), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 03:15:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 278 transitions. [2024-11-28 03:15:03,696 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 278 transitions. Word has length 15 [2024-11-28 03:15:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:03,696 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 278 transitions. [2024-11-28 03:15:03,696 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-11-28 03:15:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 278 transitions. [2024-11-28 03:15:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:15:03,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:03,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:03,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:15:03,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2019003983, now seen corresponding path program 1 times [2024-11-28 03:15:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337317853] [2024-11-28 03:15:03,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337317853] [2024-11-28 03:15:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337317853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:03,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882504044] [2024-11-28 03:15:03,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:03,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:03,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:03,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:03,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:03,881 INFO L87 Difference]: Start difference. First operand 178 states and 278 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-11-28 03:15:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:03,957 INFO L93 Difference]: Finished difference Result 369 states and 579 transitions. [2024-11-28 03:15:03,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:03,958 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-11-28 03:15:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:03,960 INFO L225 Difference]: With dead ends: 369 [2024-11-28 03:15:03,960 INFO L226 Difference]: Without dead ends: 194 [2024-11-28 03:15:03,962 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-11-28 03:15:03,962 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 25 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 801 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-11-28 03:15:03,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 801 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-28 03:15:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-28 03:15:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.52) internal successors, (228), 153 states have internal predecessors, (228), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-28 03:15:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 294 transitions. [2024-11-28 03:15:04,010 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 294 transitions. Word has length 16 [2024-11-28 03:15:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:04,010 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 294 transitions. [2024-11-28 03:15:04,010 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-11-28 03:15:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 294 transitions. [2024-11-28 03:15:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:15:04,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:04,012 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-11-28 03:15:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:15:04,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2039230838, now seen corresponding path program 1 times [2024-11-28 03:15:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364668417] [2024-11-28 03:15:04,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364668417] [2024-11-28 03:15:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364668417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:04,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:15:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735932381] [2024-11-28 03:15:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:15:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:04,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:15:04,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:15:04,300 INFO L87 Difference]: Start difference. First operand 191 states and 294 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-11-28 03:15:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:04,371 INFO L93 Difference]: Finished difference Result 401 states and 625 transitions. [2024-11-28 03:15:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:15:04,373 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-11-28 03:15:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:04,377 INFO L225 Difference]: With dead ends: 401 [2024-11-28 03:15:04,377 INFO L226 Difference]: Without dead ends: 220 [2024-11-28 03:15:04,379 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-11-28 03:15:04,380 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 22 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 542 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-11-28 03:15:04,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 542 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-28 03:15:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2024-11-28 03:15:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 152 states have (on average 1.513157894736842) internal successors, (230), 155 states have internal predecessors, (230), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-28 03:15:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 296 transitions. [2024-11-28 03:15:04,419 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 296 transitions. Word has length 24 [2024-11-28 03:15:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:04,420 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 296 transitions. [2024-11-28 03:15:04,420 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-11-28 03:15:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 296 transitions. [2024-11-28 03:15:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:15:04,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:04,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:15:04,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 981053, now seen corresponding path program 1 times [2024-11-28 03:15:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009843070] [2024-11-28 03:15:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009843070] [2024-11-28 03:15:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009843070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:15:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808308999] [2024-11-28 03:15:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:04,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:15:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:04,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:15:04,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:04,675 INFO L87 Difference]: Start difference. First operand 193 states and 296 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-11-28 03:15:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:04,768 INFO L93 Difference]: Finished difference Result 376 states and 581 transitions. [2024-11-28 03:15:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:04,769 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-11-28 03:15:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:04,772 INFO L225 Difference]: With dead ends: 376 [2024-11-28 03:15:04,772 INFO L226 Difference]: Without dead ends: 199 [2024-11-28 03:15:04,773 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-11-28 03:15:04,774 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1070 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-11-28 03:15:04,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1070 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-28 03:15:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-11-28 03:15:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 158 states have internal predecessors, (233), 33 states have call successors, (33), 7 states have call predecessors, (33), 8 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-28 03:15:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 300 transitions. [2024-11-28 03:15:04,813 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 300 transitions. Word has length 32 [2024-11-28 03:15:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:04,813 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 300 transitions. [2024-11-28 03:15:04,814 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-11-28 03:15:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 300 transitions. [2024-11-28 03:15:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:15:04,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:04,819 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] [2024-11-28 03:15:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:15:04,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -953184486, now seen corresponding path program 1 times [2024-11-28 03:15:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:04,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438615037] [2024-11-28 03:15:04,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:05,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438615037] [2024-11-28 03:15:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438615037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:05,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507510921] [2024-11-28 03:15:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:05,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:05,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:05,011 INFO L87 Difference]: Start difference. First operand 197 states and 300 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:15:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:05,120 INFO L93 Difference]: Finished difference Result 437 states and 685 transitions. [2024-11-28 03:15:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:05,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-28 03:15:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:05,129 INFO L225 Difference]: With dead ends: 437 [2024-11-28 03:15:05,129 INFO L226 Difference]: Without dead ends: 291 [2024-11-28 03:15:05,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:05,132 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 120 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:05,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 795 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-28 03:15:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 193. [2024-11-28 03:15:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 152 states have (on average 1.480263157894737) internal successors, (225), 155 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-28 03:15:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 291 transitions. [2024-11-28 03:15:05,172 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 291 transitions. Word has length 32 [2024-11-28 03:15:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 291 transitions. [2024-11-28 03:15:05,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:15:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2024-11-28 03:15:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 03:15:05,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:05,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:05,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:15:05,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:05,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 469043227, now seen corresponding path program 1 times [2024-11-28 03:15:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:05,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608860944] [2024-11-28 03:15:05,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:05,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608860944] [2024-11-28 03:15:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608860944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314432603] [2024-11-28 03:15:05,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:05,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:05,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:05,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:15:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:05,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:15:05,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:05,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:05,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314432603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:15:05,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:15:05,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-28 03:15:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626623452] [2024-11-28 03:15:05,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:15:05,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:15:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:05,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:15:05,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:15:05,615 INFO L87 Difference]: Start difference. First operand 193 states and 291 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-11-28 03:15:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:05,733 INFO L93 Difference]: Finished difference Result 434 states and 669 transitions. [2024-11-28 03:15:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:05,735 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-11-28 03:15:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:05,738 INFO L225 Difference]: With dead ends: 434 [2024-11-28 03:15:05,738 INFO L226 Difference]: Without dead ends: 252 [2024-11-28 03:15:05,740 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-11-28 03:15:05,741 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 76 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:05,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1051 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-28 03:15:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2024-11-28 03:15:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 195 states have (on average 1.4564102564102563) internal successors, (284), 198 states have internal predecessors, (284), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-28 03:15:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2024-11-28 03:15:05,767 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 35 [2024-11-28 03:15:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:05,767 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2024-11-28 03:15:05,767 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-11-28 03:15:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2024-11-28 03:15:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 03:15:05,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:05,769 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-11-28 03:15:05,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:15:05,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:05,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:05,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -985849669, now seen corresponding path program 2 times [2024-11-28 03:15:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913350321] [2024-11-28 03:15:05,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:15:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:06,014 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:15:06,014 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:15:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-28 03:15:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:06,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913350321] [2024-11-28 03:15:06,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913350321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:06,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:06,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559677514] [2024-11-28 03:15:06,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:06,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:06,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:06,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:06,098 INFO L87 Difference]: Start difference. First operand 246 states and 370 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-11-28 03:15:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:06,191 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2024-11-28 03:15:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:06,192 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-11-28 03:15:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:06,199 INFO L225 Difference]: With dead ends: 470 [2024-11-28 03:15:06,200 INFO L226 Difference]: Without dead ends: 253 [2024-11-28 03:15:06,202 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-11-28 03:15:06,202 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 8 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 775 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-11-28 03:15:06,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 775 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-28 03:15:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-11-28 03:15:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 201 states have (on average 1.4527363184079602) internal successors, (292), 204 states have internal predecessors, (292), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-28 03:15:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 378 transitions. [2024-11-28 03:15:06,241 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 378 transitions. Word has length 57 [2024-11-28 03:15:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 378 transitions. [2024-11-28 03:15:06,242 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-11-28 03:15:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 378 transitions. [2024-11-28 03:15:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-28 03:15:06,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:06,245 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-11-28 03:15:06,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:15:06,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1499220778, now seen corresponding path program 1 times [2024-11-28 03:15:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055465479] [2024-11-28 03:15:06,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-28 03:15:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055465479] [2024-11-28 03:15:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055465479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541832495] [2024-11-28 03:15:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:06,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:06,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:06,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:06,408 INFO L87 Difference]: Start difference. First operand 253 states and 378 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-28 03:15:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:06,485 INFO L93 Difference]: Finished difference Result 516 states and 782 transitions. [2024-11-28 03:15:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-28 03:15:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:06,489 INFO L225 Difference]: With dead ends: 516 [2024-11-28 03:15:06,489 INFO L226 Difference]: Without dead ends: 292 [2024-11-28 03:15:06,490 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-11-28 03:15:06,491 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 24 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 793 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-11-28 03:15:06,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 793 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-28 03:15:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2024-11-28 03:15:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 233 states have (on average 1.4120171673819744) internal successors, (329), 236 states have internal predecessors, (329), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 03:15:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2024-11-28 03:15:06,520 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 57 [2024-11-28 03:15:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:06,520 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2024-11-28 03:15:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-28 03:15:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2024-11-28 03:15:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:15:06,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:06,522 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-28 03:15:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:15:06,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:06,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -479741068, now seen corresponding path program 1 times [2024-11-28 03:15:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034934006] [2024-11-28 03:15:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-28 03:15:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034934006] [2024-11-28 03:15:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034934006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:06,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:15:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102938776] [2024-11-28 03:15:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:15:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:06,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:15:06,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:06,762 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-11-28 03:15:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:06,848 INFO L93 Difference]: Finished difference Result 527 states and 781 transitions. [2024-11-28 03:15:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:06,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 75 [2024-11-28 03:15:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:06,854 INFO L225 Difference]: With dead ends: 527 [2024-11-28 03:15:06,854 INFO L226 Difference]: Without dead ends: 291 [2024-11-28 03:15:06,855 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-11-28 03:15:06,856 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 0 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 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-11-28 03:15:06,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-28 03:15:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2024-11-28 03:15:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 233 states have (on average 1.3991416309012876) internal successors, (326), 236 states have internal predecessors, (326), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 03:15:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 418 transitions. [2024-11-28 03:15:06,887 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 418 transitions. Word has length 75 [2024-11-28 03:15:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:06,887 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 418 transitions. [2024-11-28 03:15:06,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-11-28 03:15:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 418 transitions. [2024-11-28 03:15:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-28 03:15:06,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:06,889 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 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, 1] [2024-11-28 03:15:06,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:15:06,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:06,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:06,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1651280354, now seen corresponding path program 1 times [2024-11-28 03:15:06,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:06,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467308363] [2024-11-28 03:15:06,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:06,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-28 03:15:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467308363] [2024-11-28 03:15:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467308363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296812469] [2024-11-28 03:15:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:07,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:07,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:07,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:07,098 INFO L87 Difference]: Start difference. First operand 289 states and 418 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-11-28 03:15:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:07,178 INFO L93 Difference]: Finished difference Result 564 states and 837 transitions. [2024-11-28 03:15:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:07,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 104 [2024-11-28 03:15:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:07,182 INFO L225 Difference]: With dead ends: 564 [2024-11-28 03:15:07,182 INFO L226 Difference]: Without dead ends: 333 [2024-11-28 03:15:07,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-11-28 03:15:07,186 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:07,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 793 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-28 03:15:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2024-11-28 03:15:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 270 states have (on average 1.362962962962963) internal successors, (368), 273 states have internal predecessors, (368), 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-11-28 03:15:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 466 transitions. [2024-11-28 03:15:07,228 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 466 transitions. Word has length 104 [2024-11-28 03:15:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:07,229 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 466 transitions. [2024-11-28 03:15:07,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-11-28 03:15:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 466 transitions. [2024-11-28 03:15:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 03:15:07,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:07,230 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-11-28 03:15:07,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:15:07,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:07,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1377693638, now seen corresponding path program 1 times [2024-11-28 03:15:07,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116809932] [2024-11-28 03:15:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-28 03:15:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116809932] [2024-11-28 03:15:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116809932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:07,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857648820] [2024-11-28 03:15:07,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:07,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:07,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:07,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:07,388 INFO L87 Difference]: Start difference. First operand 330 states and 466 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-11-28 03:15:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:07,463 INFO L93 Difference]: Finished difference Result 590 states and 857 transitions. [2024-11-28 03:15:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:07,464 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-11-28 03:15:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:07,467 INFO L225 Difference]: With dead ends: 590 [2024-11-28 03:15:07,467 INFO L226 Difference]: Without dead ends: 324 [2024-11-28 03:15:07,469 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-11-28 03:15:07,471 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 9 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 758 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-11-28 03:15:07,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 758 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-28 03:15:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-28 03:15:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 265 states have (on average 1.3433962264150943) internal successors, (356), 268 states have internal predecessors, (356), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-28 03:15:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 452 transitions. [2024-11-28 03:15:07,500 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 452 transitions. Word has length 105 [2024-11-28 03:15:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:07,500 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 452 transitions. [2024-11-28 03:15:07,500 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-11-28 03:15:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 452 transitions. [2024-11-28 03:15:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-28 03:15:07,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:07,502 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:07,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:15:07,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1054637287, now seen corresponding path program 1 times [2024-11-28 03:15:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807805294] [2024-11-28 03:15:07,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-28 03:15:07,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807805294] [2024-11-28 03:15:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807805294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:07,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:07,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:15:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820298848] [2024-11-28 03:15:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:07,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:15:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:07,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:15:07,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:07,695 INFO L87 Difference]: Start difference. First operand 324 states and 452 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-28 03:15:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:07,750 INFO L93 Difference]: Finished difference Result 565 states and 806 transitions. [2024-11-28 03:15:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-28 03:15:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:07,756 INFO L225 Difference]: With dead ends: 565 [2024-11-28 03:15:07,756 INFO L226 Difference]: Without dead ends: 326 [2024-11-28 03:15:07,757 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-11-28 03:15:07,758 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1041 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-11-28 03:15:07,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1041 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-28 03:15:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-11-28 03:15:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 265 states have (on average 1.3320754716981131) internal successors, (353), 268 states have internal predecessors, (353), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-28 03:15:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 449 transitions. [2024-11-28 03:15:07,786 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 449 transitions. Word has length 124 [2024-11-28 03:15:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 449 transitions. [2024-11-28 03:15:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-28 03:15:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 449 transitions. [2024-11-28 03:15:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-28 03:15:07,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:07,792 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:07,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:15:07,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:07,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash 145928495, now seen corresponding path program 1 times [2024-11-28 03:15:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426150227] [2024-11-28 03:15:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-28 03:15:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426150227] [2024-11-28 03:15:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426150227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810238694] [2024-11-28 03:15:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:07,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:07,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:07,970 INFO L87 Difference]: Start difference. First operand 324 states and 449 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-28 03:15:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:08,070 INFO L93 Difference]: Finished difference Result 528 states and 766 transitions. [2024-11-28 03:15:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:08,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-28 03:15:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:08,074 INFO L225 Difference]: With dead ends: 528 [2024-11-28 03:15:08,074 INFO L226 Difference]: Without dead ends: 322 [2024-11-28 03:15:08,075 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-11-28 03:15:08,076 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 7 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 726 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:08,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 726 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-28 03:15:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-11-28 03:15:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 264 states have (on average 1.3295454545454546) internal successors, (351), 267 states have internal predecessors, (351), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-28 03:15:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2024-11-28 03:15:08,097 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 157 [2024-11-28 03:15:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:08,098 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2024-11-28 03:15:08,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-28 03:15:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2024-11-28 03:15:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-28 03:15:08,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:08,103 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:08,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:15:08,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1893762893, now seen corresponding path program 1 times [2024-11-28 03:15:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201954175] [2024-11-28 03:15:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-28 03:15:08,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201954175] [2024-11-28 03:15:08,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201954175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:08,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314121212] [2024-11-28 03:15:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:08,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:08,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:08,354 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-28 03:15:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:08,445 INFO L93 Difference]: Finished difference Result 468 states and 662 transitions. [2024-11-28 03:15:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:08,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 173 [2024-11-28 03:15:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:08,449 INFO L225 Difference]: With dead ends: 468 [2024-11-28 03:15:08,449 INFO L226 Difference]: Without dead ends: 305 [2024-11-28 03:15:08,450 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-11-28 03:15:08,451 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 35 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:08,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 702 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-28 03:15:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-28 03:15:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 250 states have (on average 1.32) internal successors, (330), 253 states have internal predecessors, (330), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-28 03:15:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 418 transitions. [2024-11-28 03:15:08,476 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 418 transitions. Word has length 173 [2024-11-28 03:15:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:08,477 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 418 transitions. [2024-11-28 03:15:08,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-28 03:15:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 418 transitions. [2024-11-28 03:15:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-28 03:15:08,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:08,480 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:15:08,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:08,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 908239279, now seen corresponding path program 1 times [2024-11-28 03:15:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604850399] [2024-11-28 03:15:08,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-28 03:15:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604850399] [2024-11-28 03:15:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604850399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:08,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266321892] [2024-11-28 03:15:08,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:08,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:08,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:08,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:08,690 INFO L87 Difference]: Start difference. First operand 305 states and 418 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-28 03:15:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:08,768 INFO L93 Difference]: Finished difference Result 451 states and 635 transitions. [2024-11-28 03:15:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:08,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 175 [2024-11-28 03:15:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:08,771 INFO L225 Difference]: With dead ends: 451 [2024-11-28 03:15:08,772 INFO L226 Difference]: Without dead ends: 286 [2024-11-28 03:15:08,772 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-11-28 03:15:08,773 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 30 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:08,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 706 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-28 03:15:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-28 03:15:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 234 states have (on average 1.311965811965812) internal successors, (307), 237 states have internal predecessors, (307), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-28 03:15:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 389 transitions. [2024-11-28 03:15:08,794 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 389 transitions. Word has length 175 [2024-11-28 03:15:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:08,795 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 389 transitions. [2024-11-28 03:15:08,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-28 03:15:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 389 transitions. [2024-11-28 03:15:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-28 03:15:08,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:08,798 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:08,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:15:08,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 932135960, now seen corresponding path program 1 times [2024-11-28 03:15:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760886871] [2024-11-28 03:15:08,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-28 03:15:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:09,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760886871] [2024-11-28 03:15:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760886871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:09,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:15:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810298676] [2024-11-28 03:15:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:09,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:15:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:09,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:15:09,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:09,014 INFO L87 Difference]: Start difference. First operand 286 states and 389 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-28 03:15:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:09,060 INFO L93 Difference]: Finished difference Result 431 states and 605 transitions. [2024-11-28 03:15:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 176 [2024-11-28 03:15:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:09,063 INFO L225 Difference]: With dead ends: 431 [2024-11-28 03:15:09,064 INFO L226 Difference]: Without dead ends: 286 [2024-11-28 03:15:09,064 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-11-28 03:15:09,065 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-11-28 03:15:09,065 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-11-28 03:15:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-28 03:15:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-28 03:15:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 234 states have (on average 1.2863247863247864) internal successors, (301), 237 states have internal predecessors, (301), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-28 03:15:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 383 transitions. [2024-11-28 03:15:09,086 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 383 transitions. Word has length 176 [2024-11-28 03:15:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:09,086 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 383 transitions. [2024-11-28 03:15:09,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-28 03:15:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 383 transitions. [2024-11-28 03:15:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-28 03:15:09,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:09,090 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:09,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:15:09,090 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:09,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1094184049, now seen corresponding path program 1 times [2024-11-28 03:15:09,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:09,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550945418] [2024-11-28 03:15:09,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:09,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-28 03:15:09,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:09,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550945418] [2024-11-28 03:15:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550945418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848760544] [2024-11-28 03:15:09,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:09,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:09,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:15:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:09,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:15:09,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-28 03:15:09,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-28 03:15:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848760544] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:15:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-28 03:15:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001364740] [2024-11-28 03:15:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:09,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:09,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:09,899 INFO L87 Difference]: Start difference. First operand 286 states and 383 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-28 03:15:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:09,963 INFO L93 Difference]: Finished difference Result 452 states and 627 transitions. [2024-11-28 03:15:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 183 [2024-11-28 03:15:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:09,966 INFO L225 Difference]: With dead ends: 452 [2024-11-28 03:15:09,966 INFO L226 Difference]: Without dead ends: 265 [2024-11-28 03:15:09,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:09,968 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 20 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:09,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 705 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-28 03:15:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-11-28 03:15:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 216 states have (on average 1.2777777777777777) internal successors, (276), 219 states have internal predecessors, (276), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 03:15:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 352 transitions. [2024-11-28 03:15:09,993 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 352 transitions. Word has length 183 [2024-11-28 03:15:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:09,994 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 352 transitions. [2024-11-28 03:15:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-28 03:15:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 352 transitions. [2024-11-28 03:15:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-28 03:15:09,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:09,998 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:10,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:15:10,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:10,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:10,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1448461026, now seen corresponding path program 1 times [2024-11-28 03:15:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500389973] [2024-11-28 03:15:10,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-28 03:15:10,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:10,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500389973] [2024-11-28 03:15:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500389973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:10,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491248376] [2024-11-28 03:15:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:10,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:10,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:10,395 INFO L87 Difference]: Start difference. First operand 265 states and 352 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-28 03:15:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:10,448 INFO L93 Difference]: Finished difference Result 407 states and 566 transitions. [2024-11-28 03:15:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:10,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 207 [2024-11-28 03:15:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:10,452 INFO L225 Difference]: With dead ends: 407 [2024-11-28 03:15:10,455 INFO L226 Difference]: Without dead ends: 269 [2024-11-28 03:15:10,456 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-11-28 03:15:10,456 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 746 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-11-28 03:15:10,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 746 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-28 03:15:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-28 03:15:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 219 states have (on average 1.273972602739726) internal successors, (279), 222 states have internal predecessors, (279), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 03:15:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 355 transitions. [2024-11-28 03:15:10,482 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 355 transitions. Word has length 207 [2024-11-28 03:15:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:10,483 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 355 transitions. [2024-11-28 03:15:10,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-28 03:15:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 355 transitions. [2024-11-28 03:15:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-28 03:15:10,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:10,487 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2024-11-28 03:15:10,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:15:10,487 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 932888737, now seen corresponding path program 1 times [2024-11-28 03:15:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898576512] [2024-11-28 03:15:10,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-28 03:15:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898576512] [2024-11-28 03:15:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898576512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:10,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:10,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333329596] [2024-11-28 03:15:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:10,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:10,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:10,718 INFO L87 Difference]: Start difference. First operand 269 states and 355 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-11-28 03:15:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:10,774 INFO L93 Difference]: Finished difference Result 416 states and 574 transitions. [2024-11-28 03:15:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:10,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 214 [2024-11-28 03:15:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:10,778 INFO L225 Difference]: With dead ends: 416 [2024-11-28 03:15:10,778 INFO L226 Difference]: Without dead ends: 274 [2024-11-28 03:15:10,779 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-11-28 03:15:10,779 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 4 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 748 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-11-28 03:15:10,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 748 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-28 03:15:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-28 03:15:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 223 states have (on average 1.2690582959641257) internal successors, (283), 226 states have internal predecessors, (283), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 03:15:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 359 transitions. [2024-11-28 03:15:10,846 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 359 transitions. Word has length 214 [2024-11-28 03:15:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:10,846 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 359 transitions. [2024-11-28 03:15:10,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-11-28 03:15:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 359 transitions. [2024-11-28 03:15:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-28 03:15:10,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:10,850 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 3, 3, 3, 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] [2024-11-28 03:15:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:15:10,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:10,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -605662058, now seen corresponding path program 1 times [2024-11-28 03:15:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207682987] [2024-11-28 03:15:10,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-28 03:15:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207682987] [2024-11-28 03:15:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207682987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:11,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374959501] [2024-11-28 03:15:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:11,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:11,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:11,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:11,121 INFO L87 Difference]: Start difference. First operand 274 states and 359 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-11-28 03:15:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:11,188 INFO L93 Difference]: Finished difference Result 420 states and 574 transitions. [2024-11-28 03:15:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:15:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 222 [2024-11-28 03:15:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:11,194 INFO L225 Difference]: With dead ends: 420 [2024-11-28 03:15:11,195 INFO L226 Difference]: Without dead ends: 273 [2024-11-28 03:15:11,196 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-11-28 03:15:11,197 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 738 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-11-28 03:15:11,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-28 03:15:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-28 03:15:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 223 states have (on average 1.2556053811659194) internal successors, (280), 225 states have internal predecessors, (280), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-28 03:15:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 354 transitions. [2024-11-28 03:15:11,230 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 354 transitions. Word has length 222 [2024-11-28 03:15:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:11,231 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 354 transitions. [2024-11-28 03:15:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-11-28 03:15:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 354 transitions. [2024-11-28 03:15:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-28 03:15:11,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:11,236 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2024-11-28 03:15:11,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:15:11,236 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1464180836, now seen corresponding path program 1 times [2024-11-28 03:15:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025857521] [2024-11-28 03:15:11,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-28 03:15:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025857521] [2024-11-28 03:15:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025857521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:11,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:11,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:15:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83633468] [2024-11-28 03:15:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:11,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:15:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:11,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:15:11,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:15:11,479 INFO L87 Difference]: Start difference. First operand 273 states and 354 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-28 03:15:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:11,506 INFO L93 Difference]: Finished difference Result 418 states and 563 transitions. [2024-11-28 03:15:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:15:11,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 229 [2024-11-28 03:15:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:11,510 INFO L225 Difference]: With dead ends: 418 [2024-11-28 03:15:11,511 INFO L226 Difference]: Without dead ends: 272 [2024-11-28 03:15:11,511 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-11-28 03:15:11,512 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 492 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-11-28 03:15:11,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 492 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-28 03:15:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-28 03:15:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 223 states have (on average 1.251121076233184) internal successors, (279), 224 states have internal predecessors, (279), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-28 03:15:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 351 transitions. [2024-11-28 03:15:11,535 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 351 transitions. Word has length 229 [2024-11-28 03:15:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:11,536 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 351 transitions. [2024-11-28 03:15:11,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-28 03:15:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 351 transitions. [2024-11-28 03:15:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-28 03:15:11,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:11,540 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 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, 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] [2024-11-28 03:15:11,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:15:11,541 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:11,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash -326639038, now seen corresponding path program 1 times [2024-11-28 03:15:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:11,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864185142] [2024-11-28 03:15:11,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-28 03:15:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864185142] [2024-11-28 03:15:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864185142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:11,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952732817] [2024-11-28 03:15:11,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:11,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:11,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:11,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:11,981 INFO L87 Difference]: Start difference. First operand 272 states and 351 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 03:15:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:12,132 INFO L93 Difference]: Finished difference Result 625 states and 834 transitions. [2024-11-28 03:15:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:12,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 232 [2024-11-28 03:15:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:12,141 INFO L225 Difference]: With dead ends: 625 [2024-11-28 03:15:12,141 INFO L226 Difference]: Without dead ends: 480 [2024-11-28 03:15:12,142 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-11-28 03:15:12,144 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 314 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 699 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:12,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 699 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-28 03:15:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 425. [2024-11-28 03:15:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 346 states have (on average 1.2976878612716762) internal successors, (449), 348 states have internal predecessors, (449), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-28 03:15:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 557 transitions. [2024-11-28 03:15:12,194 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 557 transitions. Word has length 232 [2024-11-28 03:15:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:12,194 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 557 transitions. [2024-11-28 03:15:12,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-28 03:15:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 557 transitions. [2024-11-28 03:15:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-28 03:15:12,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:12,200 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 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] [2024-11-28 03:15:12,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:15:12,201 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:12,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash 818107137, now seen corresponding path program 1 times [2024-11-28 03:15:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718620195] [2024-11-28 03:15:12,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-28 03:15:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718620195] [2024-11-28 03:15:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718620195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:12,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:12,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:15:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012176149] [2024-11-28 03:15:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:12,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:15:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:15:12,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:15:12,453 INFO L87 Difference]: Start difference. First operand 425 states and 557 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-28 03:15:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:12,531 INFO L93 Difference]: Finished difference Result 897 states and 1229 transitions. [2024-11-28 03:15:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:15:12,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 259 [2024-11-28 03:15:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:12,537 INFO L225 Difference]: With dead ends: 897 [2024-11-28 03:15:12,538 INFO L226 Difference]: Without dead ends: 668 [2024-11-28 03:15:12,539 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-11-28 03:15:12,540 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 171 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 513 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-11-28 03:15:12,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 513 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-28 03:15:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 505. [2024-11-28 03:15:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 416 states have (on average 1.3076923076923077) internal successors, (544), 419 states have internal predecessors, (544), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-28 03:15:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 662 transitions. [2024-11-28 03:15:12,594 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 662 transitions. Word has length 259 [2024-11-28 03:15:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:12,595 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 662 transitions. [2024-11-28 03:15:12,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-28 03:15:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 662 transitions. [2024-11-28 03:15:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-28 03:15:12,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:12,600 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 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] [2024-11-28 03:15:12,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:15:12,600 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:12,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1591554880, now seen corresponding path program 1 times [2024-11-28 03:15:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123613985] [2024-11-28 03:15:12,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-28 03:15:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123613985] [2024-11-28 03:15:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123613985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:15:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127355708] [2024-11-28 03:15:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:12,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:15:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:12,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:15:12,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:15:12,783 INFO L87 Difference]: Start difference. First operand 505 states and 662 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-28 03:15:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:12,874 INFO L93 Difference]: Finished difference Result 1071 states and 1460 transitions. [2024-11-28 03:15:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:15:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 260 [2024-11-28 03:15:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:12,884 INFO L225 Difference]: With dead ends: 1071 [2024-11-28 03:15:12,884 INFO L226 Difference]: Without dead ends: 791 [2024-11-28 03:15:12,885 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-11-28 03:15:12,886 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 173 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 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-11-28 03:15:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 530 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-28 03:15:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 615. [2024-11-28 03:15:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 514 states have (on average 1.3190661478599222) internal successors, (678), 519 states have internal predecessors, (678), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-28 03:15:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 808 transitions. [2024-11-28 03:15:12,953 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 808 transitions. Word has length 260 [2024-11-28 03:15:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:12,954 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 808 transitions. [2024-11-28 03:15:12,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-28 03:15:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 808 transitions. [2024-11-28 03:15:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-28 03:15:12,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:12,960 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 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] [2024-11-28 03:15:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:15:12,960 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:12,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -442250692, now seen corresponding path program 1 times [2024-11-28 03:15:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839092502] [2024-11-28 03:15:12,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-28 03:15:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:13,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839092502] [2024-11-28 03:15:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839092502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:13,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:15:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473236450] [2024-11-28 03:15:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:15:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:13,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:15:13,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:15:13,176 INFO L87 Difference]: Start difference. First operand 615 states and 808 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:13,277 INFO L93 Difference]: Finished difference Result 1287 states and 1754 transitions. [2024-11-28 03:15:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:15:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-11-28 03:15:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:13,286 INFO L225 Difference]: With dead ends: 1287 [2024-11-28 03:15:13,287 INFO L226 Difference]: Without dead ends: 929 [2024-11-28 03:15:13,288 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-11-28 03:15:13,289 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 174 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 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-11-28 03:15:13,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 546 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-28 03:15:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 725. [2024-11-28 03:15:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 616 states have (on average 1.3344155844155845) internal successors, (822), 625 states have internal predecessors, (822), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-28 03:15:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 960 transitions. [2024-11-28 03:15:13,370 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 960 transitions. Word has length 261 [2024-11-28 03:15:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:13,370 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 960 transitions. [2024-11-28 03:15:13,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 960 transitions. [2024-11-28 03:15:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-28 03:15:13,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:13,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 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, 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] [2024-11-28 03:15:13,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 03:15:13,378 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -167491078, now seen corresponding path program 1 times [2024-11-28 03:15:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848870274] [2024-11-28 03:15:13,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-11-28 03:15:13,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848870274] [2024-11-28 03:15:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848870274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718486564] [2024-11-28 03:15:13,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:13,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:13,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:15:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:14,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:15:14,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-28 03:15:14,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718486564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:14,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:14,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-28 03:15:14,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945431430] [2024-11-28 03:15:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:14,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:14,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:14,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:15:14,124 INFO L87 Difference]: Start difference. First operand 725 states and 960 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:14,297 INFO L93 Difference]: Finished difference Result 1197 states and 1625 transitions. [2024-11-28 03:15:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:14,298 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-11-28 03:15:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:14,304 INFO L225 Difference]: With dead ends: 1197 [2024-11-28 03:15:14,304 INFO L226 Difference]: Without dead ends: 725 [2024-11-28 03:15:14,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:15:14,306 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 31 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 673 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-11-28 03:15:14,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 673 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-28 03:15:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-11-28 03:15:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 625 states have internal predecessors, (816), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-28 03:15:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 954 transitions. [2024-11-28 03:15:14,371 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 954 transitions. Word has length 261 [2024-11-28 03:15:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 954 transitions. [2024-11-28 03:15:14,372 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, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 954 transitions. [2024-11-28 03:15:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-28 03:15:14,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:14,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:14,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:15:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:14,579 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:14,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1428098569, now seen corresponding path program 1 times [2024-11-28 03:15:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205058924] [2024-11-28 03:15:14,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-28 03:15:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205058924] [2024-11-28 03:15:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205058924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72787950] [2024-11-28 03:15:14,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:14,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:14,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:14,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:15:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:15,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:15:15,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-28 03:15:15,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72787950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-28 03:15:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391323376] [2024-11-28 03:15:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:15,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:15,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:15:15,402 INFO L87 Difference]: Start difference. First operand 725 states and 954 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:15,546 INFO L93 Difference]: Finished difference Result 1197 states and 1611 transitions. [2024-11-28 03:15:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2024-11-28 03:15:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:15,553 INFO L225 Difference]: With dead ends: 1197 [2024-11-28 03:15:15,553 INFO L226 Difference]: Without dead ends: 737 [2024-11-28 03:15:15,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:15:15,555 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 7 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 681 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-11-28 03:15:15,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 681 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-28 03:15:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-11-28 03:15:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 626 states have (on average 1.3258785942492013) internal successors, (830), 635 states have internal predecessors, (830), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-28 03:15:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 968 transitions. [2024-11-28 03:15:15,619 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 968 transitions. Word has length 262 [2024-11-28 03:15:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:15,620 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 968 transitions. [2024-11-28 03:15:15,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 968 transitions. [2024-11-28 03:15:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-28 03:15:15,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:15,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:15,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:15:15,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:15,830 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1471020628, now seen corresponding path program 1 times [2024-11-28 03:15:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647575810] [2024-11-28 03:15:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-28 03:15:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647575810] [2024-11-28 03:15:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647575810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:15:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595256658] [2024-11-28 03:15:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:16,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:15:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:16,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:15:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:15:16,199 INFO L87 Difference]: Start difference. First operand 737 states and 968 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:16,282 INFO L93 Difference]: Finished difference Result 1211 states and 1625 transitions. [2024-11-28 03:15:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:15:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 263 [2024-11-28 03:15:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:16,288 INFO L225 Difference]: With dead ends: 1211 [2024-11-28 03:15:16,288 INFO L226 Difference]: Without dead ends: 717 [2024-11-28 03:15:16,289 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-11-28 03:15:16,291 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:16,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:15:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-28 03:15:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-11-28 03:15:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 607 states have (on average 1.3097199341021417) internal successors, (795), 615 states have internal predecessors, (795), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-28 03:15:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 932 transitions. [2024-11-28 03:15:16,348 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 932 transitions. Word has length 263 [2024-11-28 03:15:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:16,349 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 932 transitions. [2024-11-28 03:15:16,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-28 03:15:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 932 transitions. [2024-11-28 03:15:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-28 03:15:16,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:16,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:16,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:15:16,354 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:16,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1741891234, now seen corresponding path program 1 times [2024-11-28 03:15:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:16,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320527117] [2024-11-28 03:15:16,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:16,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-28 03:15:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:16,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320527117] [2024-11-28 03:15:16,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320527117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:16,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:16,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:15:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359550170] [2024-11-28 03:15:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:16,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:15:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:16,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:15:16,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:15:16,971 INFO L87 Difference]: Start difference. First operand 717 states and 932 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-28 03:15:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:17,119 INFO L93 Difference]: Finished difference Result 1039 states and 1425 transitions. [2024-11-28 03:15:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:15:17,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 264 [2024-11-28 03:15:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:17,132 INFO L225 Difference]: With dead ends: 1039 [2024-11-28 03:15:17,132 INFO L226 Difference]: Without dead ends: 1037 [2024-11-28 03:15:17,133 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-11-28 03:15:17,134 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 121 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1741 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:17,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1741 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-28 03:15:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 723. [2024-11-28 03:15:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 611 states have (on average 1.3076923076923077) internal successors, (799), 620 states have internal predecessors, (799), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-28 03:15:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 938 transitions. [2024-11-28 03:15:17,201 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 938 transitions. Word has length 264 [2024-11-28 03:15:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:17,202 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 938 transitions. [2024-11-28 03:15:17,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-28 03:15:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 938 transitions. [2024-11-28 03:15:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-28 03:15:17,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:17,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:17,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 03:15:17,207 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1117301399, now seen corresponding path program 1 times [2024-11-28 03:15:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:17,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919354468] [2024-11-28 03:15:17,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-28 03:15:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919354468] [2024-11-28 03:15:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919354468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785242280] [2024-11-28 03:15:17,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:17,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:17,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:17,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:15:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:18,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:15:18,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-28 03:15:18,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-28 03:15:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785242280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:15:19,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:15:19,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2024-11-28 03:15:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459453832] [2024-11-28 03:15:19,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:15:19,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:15:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:19,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:15:19,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:15:19,143 INFO L87 Difference]: Start difference. First operand 723 states and 938 transitions. Second operand has 18 states, 18 states have (on average 8.055555555555555) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-28 03:15:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:19,918 INFO L93 Difference]: Finished difference Result 1731 states and 2322 transitions. [2024-11-28 03:15:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:15:19,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.055555555555555) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 272 [2024-11-28 03:15:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:19,929 INFO L225 Difference]: With dead ends: 1731 [2024-11-28 03:15:19,929 INFO L226 Difference]: Without dead ends: 1271 [2024-11-28 03:15:19,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 535 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-28 03:15:19,932 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 241 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 3700 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:19,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 3700 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:15:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-28 03:15:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 992. [2024-11-28 03:15:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 840 states have (on average 1.2904761904761906) internal successors, (1084), 850 states have internal predecessors, (1084), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2024-11-28 03:15:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1276 transitions. [2024-11-28 03:15:20,072 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1276 transitions. Word has length 272 [2024-11-28 03:15:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:20,072 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1276 transitions. [2024-11-28 03:15:20,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.055555555555555) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-28 03:15:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1276 transitions. [2024-11-28 03:15:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-28 03:15:20,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:20,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:20,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:15:20,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:20,279 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:20,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash -155687382, now seen corresponding path program 1 times [2024-11-28 03:15:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582292428] [2024-11-28 03:15:20,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-11-28 03:15:20,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582292428] [2024-11-28 03:15:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582292428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348022767] [2024-11-28 03:15:20,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:20,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:20,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:20,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:20,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:15:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:20,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:15:20,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-28 03:15:20,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348022767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:20,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-28 03:15:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750876967] [2024-11-28 03:15:20,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:20,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:20,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:20,851 INFO L87 Difference]: Start difference. First operand 992 states and 1276 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 03:15:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:21,015 INFO L93 Difference]: Finished difference Result 1847 states and 2416 transitions. [2024-11-28 03:15:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 272 [2024-11-28 03:15:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:21,023 INFO L225 Difference]: With dead ends: 1847 [2024-11-28 03:15:21,023 INFO L226 Difference]: Without dead ends: 976 [2024-11-28 03:15:21,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:21,026 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 678 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:21,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 678 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-28 03:15:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-11-28 03:15:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 829 states have (on average 1.278648974668275) internal successors, (1060), 839 states have internal predecessors, (1060), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2024-11-28 03:15:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1243 transitions. [2024-11-28 03:15:21,104 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1243 transitions. Word has length 272 [2024-11-28 03:15:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1243 transitions. [2024-11-28 03:15:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-28 03:15:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1243 transitions. [2024-11-28 03:15:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-28 03:15:21,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:21,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:21,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:15:21,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:21,316 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:21,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1290691983, now seen corresponding path program 1 times [2024-11-28 03:15:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993131261] [2024-11-28 03:15:21,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-28 03:15:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993131261] [2024-11-28 03:15:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993131261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712402509] [2024-11-28 03:15:21,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:21,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:21,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:15:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:21,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:15:21,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-28 03:15:21,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712402509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-28 03:15:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373865467] [2024-11-28 03:15:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:21,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:21,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:21,845 INFO L87 Difference]: Start difference. First operand 976 states and 1243 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-28 03:15:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:21,980 INFO L93 Difference]: Finished difference Result 1694 states and 2199 transitions. [2024-11-28 03:15:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 275 [2024-11-28 03:15:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:21,986 INFO L225 Difference]: With dead ends: 1694 [2024-11-28 03:15:21,987 INFO L226 Difference]: Without dead ends: 830 [2024-11-28 03:15:21,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:15:21,989 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 4 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 706 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:21,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 706 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-28 03:15:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-11-28 03:15:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 701 states have (on average 1.2781740370898715) internal successors, (896), 711 states have internal predecessors, (896), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-28 03:15:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1057 transitions. [2024-11-28 03:15:22,059 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1057 transitions. Word has length 275 [2024-11-28 03:15:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:22,060 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1057 transitions. [2024-11-28 03:15:22,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-28 03:15:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1057 transitions. [2024-11-28 03:15:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-28 03:15:22,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:22,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:22,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:15:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:22,266 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:22,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1018884456, now seen corresponding path program 1 times [2024-11-28 03:15:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:22,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160486437] [2024-11-28 03:15:22,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:22,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-28 03:15:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160486437] [2024-11-28 03:15:22,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160486437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:22,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501135088] [2024-11-28 03:15:22,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:22,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:22,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:22,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:22,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:15:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:23,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 03:15:23,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-28 03:15:23,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501135088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:23,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2024-11-28 03:15:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402281043] [2024-11-28 03:15:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:23,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:15:23,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:23,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:15:23,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:15:23,387 INFO L87 Difference]: Start difference. First operand 830 states and 1057 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-28 03:15:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:23,832 INFO L93 Difference]: Finished difference Result 1582 states and 2042 transitions. [2024-11-28 03:15:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:15:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 287 [2024-11-28 03:15:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:23,839 INFO L225 Difference]: With dead ends: 1582 [2024-11-28 03:15:23,840 INFO L226 Difference]: Without dead ends: 1115 [2024-11-28 03:15:23,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:15:23,842 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 128 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:23,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1713 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:15:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-11-28 03:15:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 992. [2024-11-28 03:15:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 835 states have (on average 1.2718562874251498) internal successors, (1062), 846 states have internal predecessors, (1062), 99 states have call successors, (99), 58 states have call predecessors, (99), 57 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-28 03:15:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1259 transitions. [2024-11-28 03:15:23,943 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1259 transitions. Word has length 287 [2024-11-28 03:15:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:23,944 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1259 transitions. [2024-11-28 03:15:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-28 03:15:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1259 transitions. [2024-11-28 03:15:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-28 03:15:23,946 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:23,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:23,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:15:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:24,147 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1523809547, now seen corresponding path program 1 times [2024-11-28 03:15:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431127746] [2024-11-28 03:15:24,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-28 03:15:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431127746] [2024-11-28 03:15:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431127746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:24,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:15:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670351667] [2024-11-28 03:15:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:24,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:15:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:15:24,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:15:24,472 INFO L87 Difference]: Start difference. First operand 992 states and 1259 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-28 03:15:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:24,616 INFO L93 Difference]: Finished difference Result 1717 states and 2253 transitions. [2024-11-28 03:15:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:15:24,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-28 03:15:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:24,624 INFO L225 Difference]: With dead ends: 1717 [2024-11-28 03:15:24,624 INFO L226 Difference]: Without dead ends: 1073 [2024-11-28 03:15:24,626 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-11-28 03:15:24,627 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 32 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:24,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1226 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:15:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-28 03:15:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1047. [2024-11-28 03:15:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 878 states have (on average 1.2824601366742596) internal successors, (1126), 889 states have internal predecessors, (1126), 111 states have call successors, (111), 58 states have call predecessors, (111), 57 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-28 03:15:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1347 transitions. [2024-11-28 03:15:24,711 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1347 transitions. Word has length 293 [2024-11-28 03:15:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:24,712 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1347 transitions. [2024-11-28 03:15:24,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-28 03:15:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1347 transitions. [2024-11-28 03:15:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-28 03:15:24,715 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:24,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:24,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:15:24,716 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash 940742769, now seen corresponding path program 1 times [2024-11-28 03:15:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480984048] [2024-11-28 03:15:24,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 03:15:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480984048] [2024-11-28 03:15:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480984048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:25,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141395090] [2024-11-28 03:15:25,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:25,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:25,738 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:25,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:15:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:26,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:15:26,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-28 03:15:26,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141395090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 16 [2024-11-28 03:15:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825366558] [2024-11-28 03:15:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:15:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:26,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:15:26,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:15:26,301 INFO L87 Difference]: Start difference. First operand 1047 states and 1347 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-28 03:15:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:27,165 INFO L93 Difference]: Finished difference Result 2351 states and 3042 transitions. [2024-11-28 03:15:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:15:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-28 03:15:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:27,176 INFO L225 Difference]: With dead ends: 2351 [2024-11-28 03:15:27,176 INFO L226 Difference]: Without dead ends: 1653 [2024-11-28 03:15:27,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-28 03:15:27,179 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 599 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:27,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 2185 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:15:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-28 03:15:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1223. [2024-11-28 03:15:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1022 states have (on average 1.2749510763209393) internal successors, (1303), 1035 states have internal predecessors, (1303), 133 states have call successors, (133), 68 states have call predecessors, (133), 67 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-28 03:15:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1568 transitions. [2024-11-28 03:15:27,298 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1568 transitions. Word has length 293 [2024-11-28 03:15:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:27,298 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1568 transitions. [2024-11-28 03:15:27,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-28 03:15:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1568 transitions. [2024-11-28 03:15:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-28 03:15:27,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:27,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:27,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:15:27,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-28 03:15:27,506 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:27,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1827797617, now seen corresponding path program 1 times [2024-11-28 03:15:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870492882] [2024-11-28 03:15:27,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 03:15:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870492882] [2024-11-28 03:15:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870492882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564668612] [2024-11-28 03:15:27,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:27,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:27,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:27,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:15:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:28,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 03:15:28,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-28 03:15:28,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:15:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564668612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:28,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:15:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2024-11-28 03:15:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078058006] [2024-11-28 03:15:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:28,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:15:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:28,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:15:28,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:15:28,380 INFO L87 Difference]: Start difference. First operand 1223 states and 1568 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-28 03:15:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:28,814 INFO L93 Difference]: Finished difference Result 2198 states and 2845 transitions. [2024-11-28 03:15:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:15:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 293 [2024-11-28 03:15:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:28,824 INFO L225 Difference]: With dead ends: 2198 [2024-11-28 03:15:28,824 INFO L226 Difference]: Without dead ends: 1321 [2024-11-28 03:15:28,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:15:28,827 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 121 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:28,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1866 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:15:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-11-28 03:15:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1201. [2024-11-28 03:15:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1006 states have (on average 1.2703777335984094) internal successors, (1278), 1019 states have internal predecessors, (1278), 127 states have call successors, (127), 68 states have call predecessors, (127), 67 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-28 03:15:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1531 transitions. [2024-11-28 03:15:28,928 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1531 transitions. Word has length 293 [2024-11-28 03:15:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1531 transitions. [2024-11-28 03:15:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-28 03:15:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1531 transitions. [2024-11-28 03:15:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-28 03:15:28,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:28,934 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, 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] [2024-11-28 03:15:28,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:15:29,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 03:15:29,138 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1481762941, now seen corresponding path program 1 times [2024-11-28 03:15:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351389824] [2024-11-28 03:15:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2024-11-28 03:15:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351389824] [2024-11-28 03:15:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351389824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:15:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:15:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:15:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649298313] [2024-11-28 03:15:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:15:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:15:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:29,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:15:29,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:15:29,339 INFO L87 Difference]: Start difference. First operand 1201 states and 1531 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 03:15:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:15:29,702 INFO L93 Difference]: Finished difference Result 1982 states and 2548 transitions. [2024-11-28 03:15:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:15:29,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 302 [2024-11-28 03:15:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:15:29,711 INFO L225 Difference]: With dead ends: 1982 [2024-11-28 03:15:29,711 INFO L226 Difference]: Without dead ends: 1139 [2024-11-28 03:15:29,713 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-11-28 03:15:29,714 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 439 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:15:29,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 864 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:15:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-11-28 03:15:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 900. [2024-11-28 03:15:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 769 states have (on average 1.2457737321196358) internal successors, (958), 772 states have internal predecessors, (958), 85 states have call successors, (85), 45 states have call predecessors, (85), 45 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-28 03:15:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1128 transitions. [2024-11-28 03:15:29,785 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1128 transitions. Word has length 302 [2024-11-28 03:15:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:15:29,785 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1128 transitions. [2024-11-28 03:15:29,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-28 03:15:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1128 transitions. [2024-11-28 03:15:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-28 03:15:29,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:15:29,790 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:15:29,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 03:15:29,791 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:15:29,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1205897814, now seen corresponding path program 1 times [2024-11-28 03:15:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:29,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139788803] [2024-11-28 03:15:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-28 03:15:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139788803] [2024-11-28 03:15:30,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139788803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:30,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119871710] [2024-11-28 03:15:30,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:15:30,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:30,893 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:30,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:15:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:15:31,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 03:15:31,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 195 proven. 103 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-28 03:15:32,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 14 proven. 29 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-28 03:15:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119871710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:15:33,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:15:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 35 [2024-11-28 03:15:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855222042] [2024-11-28 03:15:33,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:15:33,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 03:15:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:33,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 03:15:33,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 03:15:33,974 INFO L87 Difference]: Start difference. First operand 900 states and 1128 transitions. Second operand has 35 states, 34 states have (on average 8.588235294117647) internal successors, (292), 32 states have internal predecessors, (292), 15 states have call successors, (51), 8 states have call predecessors, (51), 10 states have return successors, (50), 16 states have call predecessors, (50), 14 states have call successors, (50) [2024-11-28 03:16:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:06,104 INFO L93 Difference]: Finished difference Result 17010 states and 23337 transitions. [2024-11-28 03:16:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 611 states. [2024-11-28 03:16:06,105 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 8.588235294117647) internal successors, (292), 32 states have internal predecessors, (292), 15 states have call successors, (51), 8 states have call predecessors, (51), 10 states have return successors, (50), 16 states have call predecessors, (50), 14 states have call successors, (50) Word has length 342 [2024-11-28 03:16:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:06,199 INFO L225 Difference]: With dead ends: 17010 [2024-11-28 03:16:06,200 INFO L226 Difference]: Without dead ends: 16476 [2024-11-28 03:16:06,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1379 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189121 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=22510, Invalid=386450, Unknown=0, NotChecked=0, Total=408960 [2024-11-28 03:16:06,285 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 12172 mSDsluCounter, 14271 mSDsCounter, 0 mSdLazyCounter, 6641 mSolverCounterSat, 2858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12180 SdHoareTripleChecker+Valid, 15045 SdHoareTripleChecker+Invalid, 9499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2858 IncrementalHoareTripleChecker+Valid, 6641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:06,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12180 Valid, 15045 Invalid, 9499 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2858 Valid, 6641 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-28 03:16:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16476 states. [2024-11-28 03:16:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16476 to 2286. [2024-11-28 03:16:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1946 states have (on average 1.2656731757451183) internal successors, (2463), 1958 states have internal predecessors, (2463), 226 states have call successors, (226), 113 states have call predecessors, (226), 113 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) [2024-11-28 03:16:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 2915 transitions. [2024-11-28 03:16:06,809 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 2915 transitions. Word has length 342 [2024-11-28 03:16:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:06,810 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 2915 transitions. [2024-11-28 03:16:06,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 8.588235294117647) internal successors, (292), 32 states have internal predecessors, (292), 15 states have call successors, (51), 8 states have call predecessors, (51), 10 states have return successors, (50), 16 states have call predecessors, (50), 14 states have call successors, (50) [2024-11-28 03:16:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2915 transitions. [2024-11-28 03:16:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-28 03:16:06,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:06,818 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:16:06,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 03:16:07,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-28 03:16:07,021 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:16:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash -608167586, now seen corresponding path program 1 times [2024-11-28 03:16:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630635062] [2024-11-28 03:16:07,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-28 03:16:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630635062] [2024-11-28 03:16:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630635062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:16:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540523682] [2024-11-28 03:16:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:08,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:16:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:16:08,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:16:08,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:16:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:08,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 03:16:08,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:16:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 195 proven. 101 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-11-28 03:16:10,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:16:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-28 03:16:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540523682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:16:11,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:16:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 38 [2024-11-28 03:16:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818222120] [2024-11-28 03:16:11,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:16:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 03:16:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:11,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 03:16:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 03:16:11,319 INFO L87 Difference]: Start difference. First operand 2286 states and 2915 transitions. Second operand has 38 states, 37 states have (on average 8.891891891891891) internal successors, (329), 35 states have internal predecessors, (329), 17 states have call successors, (60), 8 states have call predecessors, (60), 10 states have return successors, (59), 18 states have call predecessors, (59), 16 states have call successors, (59) [2024-11-28 03:16:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:41,708 INFO L93 Difference]: Finished difference Result 37190 states and 50670 transitions. [2024-11-28 03:16:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 576 states. [2024-11-28 03:16:41,709 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 8.891891891891891) internal successors, (329), 35 states have internal predecessors, (329), 17 states have call successors, (60), 8 states have call predecessors, (60), 10 states have return successors, (59), 18 states have call predecessors, (59), 16 states have call successors, (59) Word has length 343 [2024-11-28 03:16:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:41,851 INFO L225 Difference]: With dead ends: 37190 [2024-11-28 03:16:41,851 INFO L226 Difference]: Without dead ends: 35405 [2024-11-28 03:16:41,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1334 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169052 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=24020, Invalid=345036, Unknown=0, NotChecked=0, Total=369056 [2024-11-28 03:16:41,914 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 5873 mSDsluCounter, 15941 mSDsCounter, 0 mSdLazyCounter, 8705 mSolverCounterSat, 1193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5873 SdHoareTripleChecker+Valid, 16744 SdHoareTripleChecker+Invalid, 9898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1193 IncrementalHoareTripleChecker+Valid, 8705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:41,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5873 Valid, 16744 Invalid, 9898 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1193 Valid, 8705 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 03:16:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35405 states. [2024-11-28 03:16:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35405 to 3486. [2024-11-28 03:16:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 2986 states have (on average 1.2886805090421969) internal successors, (3848), 3002 states have internal predecessors, (3848), 317 states have call successors, (317), 182 states have call predecessors, (317), 182 states have return successors, (317), 301 states have call predecessors, (317), 317 states have call successors, (317) [2024-11-28 03:16:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4482 transitions. [2024-11-28 03:16:42,894 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4482 transitions. Word has length 343 [2024-11-28 03:16:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:42,895 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 4482 transitions. [2024-11-28 03:16:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 8.891891891891891) internal successors, (329), 35 states have internal predecessors, (329), 17 states have call successors, (60), 8 states have call predecessors, (60), 10 states have return successors, (59), 18 states have call predecessors, (59), 16 states have call successors, (59) [2024-11-28 03:16:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4482 transitions. [2024-11-28 03:16:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-28 03:16:42,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:42,905 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:16:42,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 03:16:43,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-28 03:16:43,110 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:16:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash -913480989, now seen corresponding path program 1 times [2024-11-28 03:16:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088872862] [2024-11-28 03:16:43,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 34 proven. 69 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-28 03:16:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088872862] [2024-11-28 03:16:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088872862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:16:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962920622] [2024-11-28 03:16:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:45,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:16:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:16:45,599 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:16:45,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:16:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:45,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 03:16:45,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:16:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 191 proven. 102 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-28 03:16:46,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:16:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 34 proven. 69 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-28 03:16:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962920622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:16:47,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:16:47,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2024-11-28 03:16:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387399034] [2024-11-28 03:16:47,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:16:47,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:16:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:47,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:16:47,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 03:16:47,443 INFO L87 Difference]: Start difference. First operand 3486 states and 4482 transitions. Second operand has 33 states, 33 states have (on average 7.515151515151516) internal successors, (248), 27 states have internal predecessors, (248), 7 states have call successors, (41), 8 states have call predecessors, (41), 16 states have return successors, (45), 12 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-28 03:16:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:54,306 INFO L93 Difference]: Finished difference Result 13012 states and 17067 transitions. [2024-11-28 03:16:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-28 03:16:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.515151515151516) internal successors, (248), 27 states have internal predecessors, (248), 7 states have call successors, (41), 8 states have call predecessors, (41), 16 states have return successors, (45), 12 states have call predecessors, (45), 6 states have call successors, (45) Word has length 344 [2024-11-28 03:16:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:54,347 INFO L225 Difference]: With dead ends: 13012 [2024-11-28 03:16:54,348 INFO L226 Difference]: Without dead ends: 10243 [2024-11-28 03:16:54,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=983, Invalid=4869, Unknown=0, NotChecked=0, Total=5852 [2024-11-28 03:16:54,356 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 1991 mSDsluCounter, 7151 mSDsCounter, 0 mSdLazyCounter, 4286 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 7808 SdHoareTripleChecker+Invalid, 4999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 4286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:54,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 7808 Invalid, 4999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [713 Valid, 4286 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:16:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2024-11-28 03:16:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 4554. [2024-11-28 03:16:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3847 states have (on average 1.279958409149987) internal successors, (4924), 3872 states have internal predecessors, (4924), 454 states have call successors, (454), 247 states have call predecessors, (454), 252 states have return successors, (464), 434 states have call predecessors, (464), 454 states have call successors, (464) [2024-11-28 03:16:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 5842 transitions. [2024-11-28 03:16:55,459 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 5842 transitions. Word has length 344 [2024-11-28 03:16:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:55,460 INFO L471 AbstractCegarLoop]: Abstraction has 4554 states and 5842 transitions. [2024-11-28 03:16:55,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.515151515151516) internal successors, (248), 27 states have internal predecessors, (248), 7 states have call successors, (41), 8 states have call predecessors, (41), 16 states have return successors, (45), 12 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-28 03:16:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 5842 transitions. [2024-11-28 03:16:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-28 03:16:55,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:55,473 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:16:55,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 03:16:55,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-28 03:16:55,674 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:16:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1109994494, now seen corresponding path program 1 times [2024-11-28 03:16:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886945605] [2024-11-28 03:16:55,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2024-11-28 03:16:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:55,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886945605] [2024-11-28 03:16:55,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886945605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:16:55,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:16:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:16:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850451275] [2024-11-28 03:16:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:16:55,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:16:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:55,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:16:55,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:16:55,898 INFO L87 Difference]: Start difference. First operand 4554 states and 5842 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:16:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:57,045 INFO L93 Difference]: Finished difference Result 9261 states and 11867 transitions. [2024-11-28 03:16:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:16:57,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 344 [2024-11-28 03:16:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:57,070 INFO L225 Difference]: With dead ends: 9261 [2024-11-28 03:16:57,070 INFO L226 Difference]: Without dead ends: 4534 [2024-11-28 03:16:57,079 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-11-28 03:16:57,080 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 26 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 652 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:57,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 652 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:16:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2024-11-28 03:16:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 4534. [2024-11-28 03:16:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 3832 states have (on average 1.2554801670146138) internal successors, (4811), 3857 states have internal predecessors, (4811), 454 states have call successors, (454), 247 states have call predecessors, (454), 247 states have return successors, (454), 429 states have call predecessors, (454), 454 states have call successors, (454) [2024-11-28 03:16:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5719 transitions. [2024-11-28 03:16:58,162 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5719 transitions. Word has length 344 [2024-11-28 03:16:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:58,163 INFO L471 AbstractCegarLoop]: Abstraction has 4534 states and 5719 transitions. [2024-11-28 03:16:58,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:16:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5719 transitions. [2024-11-28 03:16:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-28 03:16:58,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:58,176 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:16:58,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 03:16:58,177 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:16:58,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -403050429, now seen corresponding path program 1 times [2024-11-28 03:16:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312624413] [2024-11-28 03:16:58,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:16:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2024-11-28 03:16:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:16:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312624413] [2024-11-28 03:16:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312624413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:16:58,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:16:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:16:58,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727728804] [2024-11-28 03:16:58,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:16:58,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:16:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:16:58,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:16:58,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:16:58,534 INFO L87 Difference]: Start difference. First operand 4534 states and 5719 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-28 03:16:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:16:59,029 INFO L93 Difference]: Finished difference Result 6940 states and 8785 transitions. [2024-11-28 03:16:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:16:59,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 344 [2024-11-28 03:16:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:16:59,043 INFO L225 Difference]: With dead ends: 6940 [2024-11-28 03:16:59,043 INFO L226 Difference]: Without dead ends: 2891 [2024-11-28 03:16:59,050 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-11-28 03:16:59,051 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:16:59,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:16:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2024-11-28 03:16:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2891. [2024-11-28 03:16:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2431 states have (on average 1.2447552447552448) internal successors, (3026), 2447 states have internal predecessors, (3026), 297 states have call successors, (297), 162 states have call predecessors, (297), 162 states have return successors, (297), 281 states have call predecessors, (297), 297 states have call successors, (297) [2024-11-28 03:16:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 3620 transitions. [2024-11-28 03:16:59,701 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 3620 transitions. Word has length 344 [2024-11-28 03:16:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:16:59,701 INFO L471 AbstractCegarLoop]: Abstraction has 2891 states and 3620 transitions. [2024-11-28 03:16:59,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-28 03:16:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 3620 transitions. [2024-11-28 03:16:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-28 03:16:59,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:16:59,710 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:16:59,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 03:16:59,711 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:16:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:16:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2064996776, now seen corresponding path program 1 times [2024-11-28 03:16:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:16:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129484437] [2024-11-28 03:16:59,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:16:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:16:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 57 proven. 52 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-11-28 03:17:01,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:01,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129484437] [2024-11-28 03:17:01,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129484437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:01,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464030046] [2024-11-28 03:17:01,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:01,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:01,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:01,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:01,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:17:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:02,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 03:17:02,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 259 proven. 89 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-11-28 03:17:02,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 57 proven. 52 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-11-28 03:17:03,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464030046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:03,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:03,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-11-28 03:17:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548944373] [2024-11-28 03:17:03,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:03,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 03:17:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:03,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 03:17:03,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 03:17:03,340 INFO L87 Difference]: Start difference. First operand 2891 states and 3620 transitions. Second operand has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 27 states have internal predecessors, (265), 7 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (49), 12 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-28 03:17:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:10,132 INFO L93 Difference]: Finished difference Result 11321 states and 14477 transitions. [2024-11-28 03:17:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-28 03:17:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 27 states have internal predecessors, (265), 7 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (49), 12 states have call predecessors, (49), 6 states have call successors, (49) Word has length 354 [2024-11-28 03:17:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:10,166 INFO L225 Difference]: With dead ends: 11321 [2024-11-28 03:17:10,166 INFO L226 Difference]: Without dead ends: 9046 [2024-11-28 03:17:10,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=970, Invalid=4730, Unknown=0, NotChecked=0, Total=5700 [2024-11-28 03:17:10,174 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2202 mSDsluCounter, 8877 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 9531 SdHoareTripleChecker+Invalid, 5206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:10,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 9531 Invalid, 5206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [694 Valid, 4512 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 03:17:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9046 states. [2024-11-28 03:17:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9046 to 3838. [2024-11-28 03:17:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3184 states have (on average 1.2327261306532664) internal successors, (3925), 3209 states have internal predecessors, (3925), 430 states have call successors, (430), 223 states have call predecessors, (430), 223 states have return successors, (430), 405 states have call predecessors, (430), 430 states have call successors, (430) [2024-11-28 03:17:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 4785 transitions. [2024-11-28 03:17:11,133 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 4785 transitions. Word has length 354 [2024-11-28 03:17:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:11,134 INFO L471 AbstractCegarLoop]: Abstraction has 3838 states and 4785 transitions. [2024-11-28 03:17:11,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 27 states have internal predecessors, (265), 7 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (49), 12 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-28 03:17:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 4785 transitions. [2024-11-28 03:17:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-28 03:17:11,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:11,145 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:17:11,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 03:17:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:11,350 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:11,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1481302474, now seen corresponding path program 1 times [2024-11-28 03:17:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643603659] [2024-11-28 03:17:11,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-28 03:17:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643603659] [2024-11-28 03:17:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643603659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:11,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277624399] [2024-11-28 03:17:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:11,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:11,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:11,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:11,716 INFO L87 Difference]: Start difference. First operand 3838 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 03:17:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:12,262 INFO L93 Difference]: Finished difference Result 5927 states and 7416 transitions. [2024-11-28 03:17:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:12,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 355 [2024-11-28 03:17:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:12,273 INFO L225 Difference]: With dead ends: 5927 [2024-11-28 03:17:12,273 INFO L226 Difference]: Without dead ends: 2511 [2024-11-28 03:17:12,280 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-11-28 03:17:12,280 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:12,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2024-11-28 03:17:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2511. [2024-11-28 03:17:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2071 states have (on average 1.2225977788507967) internal successors, (2532), 2087 states have internal predecessors, (2532), 287 states have call successors, (287), 152 states have call predecessors, (287), 152 states have return successors, (287), 271 states have call predecessors, (287), 287 states have call successors, (287) [2024-11-28 03:17:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3106 transitions. [2024-11-28 03:17:12,941 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3106 transitions. Word has length 355 [2024-11-28 03:17:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3106 transitions. [2024-11-28 03:17:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 03:17:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3106 transitions. [2024-11-28 03:17:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-28 03:17:12,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:12,949 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 9, 8, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:12,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 03:17:12,949 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:12,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1253126274, now seen corresponding path program 1 times [2024-11-28 03:17:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:12,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970102182] [2024-11-28 03:17:12,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2024-11-28 03:17:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:13,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970102182] [2024-11-28 03:17:13,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970102182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:13,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880877401] [2024-11-28 03:17:13,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:13,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:13,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:13,327 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:13,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:17:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:13,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 03:17:13,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 127 proven. 205 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-28 03:17:14,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2024-11-28 03:17:14,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880877401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:14,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 19 [2024-11-28 03:17:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571331153] [2024-11-28 03:17:14,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:17:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:17:14,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:17:14,681 INFO L87 Difference]: Start difference. First operand 2511 states and 3106 transitions. Second operand has 19 states, 19 states have (on average 14.31578947368421) internal successors, (272), 17 states have internal predecessors, (272), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-28 03:17:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:18,737 INFO L93 Difference]: Finished difference Result 9690 states and 12100 transitions. [2024-11-28 03:17:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-28 03:17:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.31578947368421) internal successors, (272), 17 states have internal predecessors, (272), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) Word has length 360 [2024-11-28 03:17:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:18,759 INFO L225 Difference]: With dead ends: 9690 [2024-11-28 03:17:18,759 INFO L226 Difference]: Without dead ends: 7731 [2024-11-28 03:17:18,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 716 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=6140, Unknown=0, NotChecked=0, Total=6806 [2024-11-28 03:17:18,766 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1572 mSDsluCounter, 6057 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:18,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 6557 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 03:17:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2024-11-28 03:17:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 4408. [2024-11-28 03:17:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 3640 states have (on average 1.228021978021978) internal successors, (4470), 3668 states have internal predecessors, (4470), 503 states have call successors, (503), 264 states have call predecessors, (503), 264 states have return successors, (503), 475 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-28 03:17:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5476 transitions. [2024-11-28 03:17:19,862 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5476 transitions. Word has length 360 [2024-11-28 03:17:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:19,863 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5476 transitions. [2024-11-28 03:17:19,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.31578947368421) internal successors, (272), 17 states have internal predecessors, (272), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-28 03:17:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5476 transitions. [2024-11-28 03:17:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-28 03:17:19,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:19,870 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1] [2024-11-28 03:17:19,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 03:17:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-28 03:17:20,071 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:20,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1803114442, now seen corresponding path program 1 times [2024-11-28 03:17:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173756977] [2024-11-28 03:17:20,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 43 proven. 201 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2024-11-28 03:17:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173756977] [2024-11-28 03:17:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173756977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723119126] [2024-11-28 03:17:22,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:22,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:22,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:22,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 03:17:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:22,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 03:17:22,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 413 proven. 200 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-28 03:17:23,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 47 proven. 197 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2024-11-28 03:17:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723119126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:24,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 19] total 45 [2024-11-28 03:17:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856267948] [2024-11-28 03:17:24,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:24,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:17:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:24,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:17:24,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2024-11-28 03:17:24,964 INFO L87 Difference]: Start difference. First operand 4408 states and 5476 transitions. Second operand has 45 states, 43 states have (on average 7.372093023255814) internal successors, (317), 38 states have internal predecessors, (317), 15 states have call successors, (54), 10 states have call predecessors, (54), 17 states have return successors, (57), 17 states have call predecessors, (57), 14 states have call successors, (57) [2024-11-28 03:17:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:29,683 INFO L93 Difference]: Finished difference Result 10194 states and 12953 transitions. [2024-11-28 03:17:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 03:17:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 7.372093023255814) internal successors, (317), 38 states have internal predecessors, (317), 15 states have call successors, (54), 10 states have call predecessors, (54), 17 states have return successors, (57), 17 states have call predecessors, (57), 14 states have call successors, (57) Word has length 365 [2024-11-28 03:17:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:29,707 INFO L225 Difference]: With dead ends: 10194 [2024-11-28 03:17:29,707 INFO L226 Difference]: Without dead ends: 6266 [2024-11-28 03:17:29,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=639, Invalid=4763, Unknown=0, NotChecked=0, Total=5402 [2024-11-28 03:17:29,718 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1417 mSDsluCounter, 4804 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 5033 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:29,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 5033 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 03:17:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2024-11-28 03:17:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 4755. [2024-11-28 03:17:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 3941 states have (on average 1.2197411824410047) internal successors, (4807), 3969 states have internal predecessors, (4807), 528 states have call successors, (528), 283 states have call predecessors, (528), 285 states have return successors, (532), 502 states have call predecessors, (532), 528 states have call successors, (532) [2024-11-28 03:17:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 5867 transitions. [2024-11-28 03:17:30,778 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 5867 transitions. Word has length 365 [2024-11-28 03:17:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:30,778 INFO L471 AbstractCegarLoop]: Abstraction has 4755 states and 5867 transitions. [2024-11-28 03:17:30,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 7.372093023255814) internal successors, (317), 38 states have internal predecessors, (317), 15 states have call successors, (54), 10 states have call predecessors, (54), 17 states have return successors, (57), 17 states have call predecessors, (57), 14 states have call successors, (57) [2024-11-28 03:17:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 5867 transitions. [2024-11-28 03:17:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-28 03:17:30,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:30,783 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1] [2024-11-28 03:17:30,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 03:17:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-28 03:17:30,984 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1734183484, now seen corresponding path program 1 times [2024-11-28 03:17:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271652674] [2024-11-28 03:17:30,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 9 proven. 139 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2024-11-28 03:17:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271652674] [2024-11-28 03:17:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271652674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542489049] [2024-11-28 03:17:31,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:31,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:31,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:31,122 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:31,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 03:17:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:31,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:17:31,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2024-11-28 03:17:31,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:17:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542489049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:31,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:17:31,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-28 03:17:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721046700] [2024-11-28 03:17:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:17:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:31,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:17:31,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:31,509 INFO L87 Difference]: Start difference. First operand 4755 states and 5867 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 03:17:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:32,300 INFO L93 Difference]: Finished difference Result 9164 states and 11344 transitions. [2024-11-28 03:17:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:17:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 368 [2024-11-28 03:17:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:32,310 INFO L225 Difference]: With dead ends: 9164 [2024-11-28 03:17:32,310 INFO L226 Difference]: Without dead ends: 4410 [2024-11-28 03:17:32,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:17:32,315 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 18 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 621 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:32,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 621 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:17:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2024-11-28 03:17:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4410. [2024-11-28 03:17:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 3641 states have (on average 1.226036803076078) internal successors, (4464), 3669 states have internal predecessors, (4464), 503 states have call successors, (503), 265 states have call predecessors, (503), 265 states have return successors, (503), 475 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-28 03:17:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 5470 transitions. [2024-11-28 03:17:33,193 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 5470 transitions. Word has length 368 [2024-11-28 03:17:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:33,194 INFO L471 AbstractCegarLoop]: Abstraction has 4410 states and 5470 transitions. [2024-11-28 03:17:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 03:17:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 5470 transitions. [2024-11-28 03:17:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-28 03:17:33,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:33,199 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 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, 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] [2024-11-28 03:17:33,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 03:17:33,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-28 03:17:33,400 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash 356911921, now seen corresponding path program 1 times [2024-11-28 03:17:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934443958] [2024-11-28 03:17:33,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 94 proven. 181 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2024-11-28 03:17:35,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:35,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934443958] [2024-11-28 03:17:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934443958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891451090] [2024-11-28 03:17:35,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:35,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:35,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:35,636 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:35,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 03:17:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:35,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-28 03:17:35,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 479 proven. 250 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-28 03:17:36,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 95 proven. 178 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2024-11-28 03:17:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891451090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:37,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 47 [2024-11-28 03:17:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402726117] [2024-11-28 03:17:37,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 03:17:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:38,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 03:17:38,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 03:17:38,001 INFO L87 Difference]: Start difference. First operand 4410 states and 5470 transitions. Second operand has 47 states, 46 states have (on average 7.630434782608695) internal successors, (351), 40 states have internal predecessors, (351), 15 states have call successors, (59), 10 states have call predecessors, (59), 20 states have return successors, (60), 18 states have call predecessors, (60), 14 states have call successors, (60) [2024-11-28 03:17:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:41,726 INFO L93 Difference]: Finished difference Result 9585 states and 12250 transitions. [2024-11-28 03:17:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 03:17:41,726 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 7.630434782608695) internal successors, (351), 40 states have internal predecessors, (351), 15 states have call successors, (59), 10 states have call predecessors, (59), 20 states have return successors, (60), 18 states have call predecessors, (60), 14 states have call successors, (60) Word has length 375 [2024-11-28 03:17:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:41,739 INFO L225 Difference]: With dead ends: 9585 [2024-11-28 03:17:41,739 INFO L226 Difference]: Without dead ends: 5657 [2024-11-28 03:17:41,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=630, Invalid=5070, Unknown=0, NotChecked=0, Total=5700 [2024-11-28 03:17:41,746 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 990 mSDsluCounter, 4271 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:41,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 4502 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 03:17:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2024-11-28 03:17:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 4416. [2024-11-28 03:17:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4416 states, 3646 states have (on average 1.2246297312122874) internal successors, (4465), 3674 states have internal predecessors, (4465), 503 states have call successors, (503), 266 states have call predecessors, (503), 266 states have return successors, (503), 475 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-28 03:17:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5471 transitions. [2024-11-28 03:17:42,713 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5471 transitions. Word has length 375 [2024-11-28 03:17:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:42,714 INFO L471 AbstractCegarLoop]: Abstraction has 4416 states and 5471 transitions. [2024-11-28 03:17:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 7.630434782608695) internal successors, (351), 40 states have internal predecessors, (351), 15 states have call successors, (59), 10 states have call predecessors, (59), 20 states have return successors, (60), 18 states have call predecessors, (60), 14 states have call successors, (60) [2024-11-28 03:17:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5471 transitions. [2024-11-28 03:17:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-28 03:17:42,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:42,722 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 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, 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] [2024-11-28 03:17:42,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 03:17:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-28 03:17:42,923 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:42,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1307761664, now seen corresponding path program 1 times [2024-11-28 03:17:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973383410] [2024-11-28 03:17:42,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 142 proven. 137 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2024-11-28 03:17:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973383410] [2024-11-28 03:17:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973383410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577887734] [2024-11-28 03:17:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:44,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:44,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:44,813 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:44,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 03:17:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:45,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-28 03:17:45,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 465 proven. 292 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-28 03:17:46,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 163 proven. 129 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-28 03:17:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577887734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:47,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 20] total 45 [2024-11-28 03:17:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072749535] [2024-11-28 03:17:47,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:47,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:17:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:47,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:17:47,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2024-11-28 03:17:47,358 INFO L87 Difference]: Start difference. First operand 4416 states and 5471 transitions. Second operand has 45 states, 44 states have (on average 8.295454545454545) internal successors, (365), 37 states have internal predecessors, (365), 14 states have call successors, (62), 9 states have call predecessors, (62), 19 states have return successors, (64), 19 states have call predecessors, (64), 13 states have call successors, (64) [2024-11-28 03:17:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:53,363 INFO L93 Difference]: Finished difference Result 11268 states and 14395 transitions. [2024-11-28 03:17:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-28 03:17:53,364 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 8.295454545454545) internal successors, (365), 37 states have internal predecessors, (365), 14 states have call successors, (62), 9 states have call predecessors, (62), 19 states have return successors, (64), 19 states have call predecessors, (64), 13 states have call successors, (64) Word has length 386 [2024-11-28 03:17:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:53,384 INFO L225 Difference]: With dead ends: 11268 [2024-11-28 03:17:53,385 INFO L226 Difference]: Without dead ends: 7340 [2024-11-28 03:17:53,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=887, Invalid=7485, Unknown=0, NotChecked=0, Total=8372 [2024-11-28 03:17:53,393 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 1784 mSDsluCounter, 5768 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 6018 SdHoareTripleChecker+Invalid, 4439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:53,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1799 Valid, 6018 Invalid, 4439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 3850 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 03:17:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7340 states. [2024-11-28 03:17:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7340 to 4423. [2024-11-28 03:17:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 3652 states have (on average 1.2231653888280394) internal successors, (4467), 3680 states have internal predecessors, (4467), 503 states have call successors, (503), 267 states have call predecessors, (503), 267 states have return successors, (503), 475 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-28 03:17:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 5473 transitions. [2024-11-28 03:17:54,359 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 5473 transitions. Word has length 386 [2024-11-28 03:17:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:54,359 INFO L471 AbstractCegarLoop]: Abstraction has 4423 states and 5473 transitions. [2024-11-28 03:17:54,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 8.295454545454545) internal successors, (365), 37 states have internal predecessors, (365), 14 states have call successors, (62), 9 states have call predecessors, (62), 19 states have return successors, (64), 19 states have call predecessors, (64), 13 states have call successors, (64) [2024-11-28 03:17:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 5473 transitions. [2024-11-28 03:17:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2024-11-28 03:17:54,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:54,364 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 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] [2024-11-28 03:17:54,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 03:17:54,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-28 03:17:54,564 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:17:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1030650985, now seen corresponding path program 1 times [2024-11-28 03:17:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564080914] [2024-11-28 03:17:54,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:54,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:17:54,715 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:17:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:17:55,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:17:55,110 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:17:55,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:17:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-28 03:17:55,116 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:55,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:17:55,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:17:55 BoogieIcfgContainer [2024-11-28 03:17:55,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:17:55,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:17:55,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:17:55,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:17:55,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:02" (3/4) ... [2024-11-28 03:17:55,451 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:17:55,828 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 293. [2024-11-28 03:17:56,078 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:17:56,079 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:17:56,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:17:56,080 INFO L158 Benchmark]: Toolchain (without parser) took 175380.20ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 104.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 512.9MB. Max. memory is 16.1GB. [2024-11-28 03:17:56,080 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:17:56,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.17ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 87.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:17:56,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.01ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 84.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:17:56,081 INFO L158 Benchmark]: Boogie Preprocessor took 112.48ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 81.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:17:56,081 INFO L158 Benchmark]: RCFGBuilder took 1202.91ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 44.1MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:17:56,081 INFO L158 Benchmark]: TraceAbstraction took 172751.89ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 378.7MB. Max. memory is 16.1GB. [2024-11-28 03:17:56,082 INFO L158 Benchmark]: Witness Printer took 630.50ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 71.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-28 03:17:56,083 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.87ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.17ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 87.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.01ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 84.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 112.48ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 81.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1202.91ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 44.1MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 172751.89ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 378.7MB. Max. memory is 16.1GB. * Witness Printer took 630.50ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 71.3MB). Peak memory consumption was 75.5MB. 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: 535]: 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 ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] 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] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L73] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L73] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L73] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L73] tmp = (int )read_history_bool(0, 0) [L74] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L79] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L79] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L79] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L84] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L85] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L84] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L85] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L84] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L85] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L84] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L90] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L91] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L84] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L90] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L91] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L72] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L78] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L84] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L90] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L91] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L96] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, 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] [L71] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, i2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 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=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, i2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] 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)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=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=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] 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)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=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=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] 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=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) [L346] 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=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] 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)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=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=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=1, \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=0, gate2Failed_History_2=1, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] 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)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=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=-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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=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=-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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=1, \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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=1, \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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=1, gate3Failed_History_2=1, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=1, \old(gate3Failed_History_2)=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=-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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=2, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=2, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=3, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, temp_count=3, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, i2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] 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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \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=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] 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)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \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=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] 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=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] 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=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] 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)=1, \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=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] 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)=1, \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=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] 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)=1, \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=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] 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)=1, \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] [L406] 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] [L407] COND TRUE \read(gate3Failed) [L408] 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] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] 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] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] 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] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] 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] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] 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] [L249] COND TRUE ! gate1Failed [L250] 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] [L260] COND FALSE !(!((_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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] 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] [L126] 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] [L127] 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] [L130] COND TRUE historyIndex == 1 [L131] 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] [L261] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] 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] [L106] 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] [L107] 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] [L110] COND TRUE historyIndex == 1 [L111] 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] [L300] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] 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] [L106] 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] [L107] COND TRUE historyIndex == 0 [L108] 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] [L302] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] 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] [L126] 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] [L127] 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] [L130] COND TRUE historyIndex == 1 [L131] 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] [L304] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] 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] [L126] 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] [L136] 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] [L137] 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] [L140] COND TRUE historyIndex == 1 [L141] 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] [L306] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] 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] [L126] 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] [L136] 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] [L146] 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] [L147] 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] [L150] COND TRUE historyIndex == 1 [L151] 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] [L308] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] 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, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] 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] [L533] 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] [L535] 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 6 procedures, 176 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 172.3s, OverallIterations: 50, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 104.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31198 SdHoareTripleChecker+Valid, 33.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31024 mSDsluCounter, 109118 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93960 mSDsCounter, 7631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38881 IncrementalHoareTripleChecker+Invalid, 46512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7631 mSolverCounterUnsat, 15158 mSDtfsCounter, 38881 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11053 GetRequests, 9144 SyntacticMatches, 14 SemanticMatches, 1895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367472 ImplicationChecksByTransitivity, 54.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4755occurred in iteration=46, InterpolantAutomatonStates: 1685, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 68273 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 17123 NumberOfCodeBlocks, 17082 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 19991 ConstructedInterpolants, 0 QuantifiedInterpolants, 39910 SizeOfPredicates, 46 NumberOfNonLiveVariables, 20723 ConjunctsInSsa, 434 ConjunctsInUnsatCore, 79 InterpolantComputations, 39 PerfectInterpolantSequences, 48168/51213 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-11-28 03:17:56,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db7db38-0bc1-4e30-ab0b-c1e90853675f/bin/uautomizer-verify-aQ6SnzHsRB/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