./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G --witnessprinter.witness.filename witness.graphml --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 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 14:12:12,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 14:12:12,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 14:12:12,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 14:12:12,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 14:12:12,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 14:12:12,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 14:12:12,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 14:12:12,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 14:12:12,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 14:12:12,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 14:12:12,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 14:12:12,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 14:12:12,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 14:12:12,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 14:12:12,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 14:12:12,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 14:12:12,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 14:12:12,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 14:12:12,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 14:12:12,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 14:12:12,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 14:12:12,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 14:12:12,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 14:12:12,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 14:12:12,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 14:12:12,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 14:12:12,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 14:12:12,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 14:12:12,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 14:12:12,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 14:12:12,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 14:12:12,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 14:12:12,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 14:12:12,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 14:12:12,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 14:12:12,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 14:12:12,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 14:12:12,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 14:12:12,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 14:12:12,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 14:12:12,688 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 14:12:12,713 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 14:12:12,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 14:12:12,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 14:12:12,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 14:12:12,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 14:12:12,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 14:12:12,716 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 14:12:12,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 14:12:12,717 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 14:12:12,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 14:12:12,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 14:12:12,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 14:12:12,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 14:12:12,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 14:12:12,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 14:12:12,719 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 14:12:12,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 14:12:12,719 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 14:12:12,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 14:12:12,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 14:12:12,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 14:12:12,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 14:12:12,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 14:12:12,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 14:12:12,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 14:12:12,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 14:12:12,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 14:12:12,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 14:12:12,727 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 14:12:12,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 14:12:12,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 14:12:12,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 14:12:12,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2021-11-23 14:12:13,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 14:12:13,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 14:12:13,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 14:12:13,088 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 14:12:13,089 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 14:12:13,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2021-11-23 14:12:13,184 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/data/282b3a13f/52d66ea07d09483384d3dbea2fc34e0c/FLAG6ed3305fb [2021-11-23 14:12:13,717 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 14:12:13,718 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2021-11-23 14:12:13,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/data/282b3a13f/52d66ea07d09483384d3dbea2fc34e0c/FLAG6ed3305fb [2021-11-23 14:12:14,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/data/282b3a13f/52d66ea07d09483384d3dbea2fc34e0c [2021-11-23 14:12:14,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 14:12:14,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 14:12:14,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 14:12:14,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 14:12:14,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 14:12:14,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402e0be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14, skipping insertion in model container [2021-11-23 14:12:14,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 14:12:14,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 14:12:14,388 WARN L230 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_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2021-11-23 14:12:14,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 14:12:14,400 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 14:12:14,488 WARN L230 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_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2021-11-23 14:12:14,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 14:12:14,505 INFO L208 MainTranslator]: Completed translation [2021-11-23 14:12:14,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14 WrapperNode [2021-11-23 14:12:14,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 14:12:14,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 14:12:14,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 14:12:14,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 14:12:14,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,626 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 43, calls inlined = 61, statements flattened = 956 [2021-11-23 14:12:14,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 14:12:14,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 14:12:14,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 14:12:14,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 14:12:14,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 14:12:14,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 14:12:14,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 14:12:14,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 14:12:14,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (1/1) ... [2021-11-23 14:12:14,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 14:12:14,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:14,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 14:12:14,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 14:12:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 14:12:14,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 14:12:14,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 14:12:14,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 14:12:14,927 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 14:12:14,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 14:12:15,854 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 14:12:15,867 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 14:12:15,867 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 14:12:15,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:15 BoogieIcfgContainer [2021-11-23 14:12:15,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 14:12:15,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 14:12:15,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 14:12:15,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 14:12:15,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:12:14" (1/3) ... [2021-11-23 14:12:15,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6ff5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:12:15, skipping insertion in model container [2021-11-23 14:12:15,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:12:14" (2/3) ... [2021-11-23 14:12:15,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6ff5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:12:15, skipping insertion in model container [2021-11-23 14:12:15,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:15" (3/3) ... [2021-11-23 14:12:15,884 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2021-11-23 14:12:15,892 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 14:12:15,892 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-11-23 14:12:15,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 14:12:15,997 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 14:12:15,997 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-11-23 14:12:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 300 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 14:12:16,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:16,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:16,110 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash -686079497, now seen corresponding path program 1 times [2021-11-23 14:12:16,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:16,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423393593] [2021-11-23 14:12:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:16,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:16,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:16,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423393593] [2021-11-23 14:12:16,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423393593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:16,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:16,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 14:12:16,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242012580] [2021-11-23 14:12:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:16,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 14:12:16,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 14:12:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 14:12:16,420 INFO L87 Difference]: Start difference. First operand has 301 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 300 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:16,478 INFO L93 Difference]: Finished difference Result 582 states and 906 transitions. [2021-11-23 14:12:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 14:12:16,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 14:12:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:16,494 INFO L225 Difference]: With dead ends: 582 [2021-11-23 14:12:16,494 INFO L226 Difference]: Without dead ends: 297 [2021-11-23 14:12:16,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 14:12:16,507 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:16,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-23 14:12:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-11-23 14:12:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 274 states have (on average 1.5802919708029197) internal successors, (433), 296 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 433 transitions. [2021-11-23 14:12:16,568 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 433 transitions. Word has length 36 [2021-11-23 14:12:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:16,568 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 433 transitions. [2021-11-23 14:12:16,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 433 transitions. [2021-11-23 14:12:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 14:12:16,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:16,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:16,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 14:12:16,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:16,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash 84849397, now seen corresponding path program 1 times [2021-11-23 14:12:16,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:16,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198074356] [2021-11-23 14:12:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:16,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:16,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198074356] [2021-11-23 14:12:16,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198074356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:16,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:16,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:16,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12461541] [2021-11-23 14:12:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:16,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:16,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:16,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:16,658 INFO L87 Difference]: Start difference. First operand 297 states and 433 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:16,744 INFO L93 Difference]: Finished difference Result 580 states and 840 transitions. [2021-11-23 14:12:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 14:12:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 14:12:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:16,748 INFO L225 Difference]: With dead ends: 580 [2021-11-23 14:12:16,749 INFO L226 Difference]: Without dead ends: 297 [2021-11-23 14:12:16,751 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:16,752 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:16,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1279 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-11-23 14:12:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-11-23 14:12:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 274 states have (on average 1.5364963503649636) internal successors, (421), 296 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 421 transitions. [2021-11-23 14:12:16,780 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 421 transitions. Word has length 36 [2021-11-23 14:12:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:16,781 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 421 transitions. [2021-11-23 14:12:16,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 421 transitions. [2021-11-23 14:12:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 14:12:16,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:16,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:16,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 14:12:16,787 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:16,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2109406506, now seen corresponding path program 1 times [2021-11-23 14:12:16,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:16,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161844442] [2021-11-23 14:12:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:16,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:17,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:17,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161844442] [2021-11-23 14:12:17,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161844442] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:17,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:17,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:17,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325636529] [2021-11-23 14:12:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:17,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:17,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:17,055 INFO L87 Difference]: Start difference. First operand 297 states and 421 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:17,131 INFO L93 Difference]: Finished difference Result 614 states and 878 transitions. [2021-11-23 14:12:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:17,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-23 14:12:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:17,138 INFO L225 Difference]: With dead ends: 614 [2021-11-23 14:12:17,138 INFO L226 Difference]: Without dead ends: 334 [2021-11-23 14:12:17,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:17,151 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 279 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:17,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 633 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-23 14:12:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 273. [2021-11-23 14:12:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 254 states have (on average 1.515748031496063) internal successors, (385), 272 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 385 transitions. [2021-11-23 14:12:17,199 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 385 transitions. Word has length 47 [2021-11-23 14:12:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:17,200 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 385 transitions. [2021-11-23 14:12:17,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 385 transitions. [2021-11-23 14:12:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 14:12:17,202 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:17,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:17,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 14:12:17,203 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -256535450, now seen corresponding path program 1 times [2021-11-23 14:12:17,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:17,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360123368] [2021-11-23 14:12:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:17,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:17,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:17,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360123368] [2021-11-23 14:12:17,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360123368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:17,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:17,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:17,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624079730] [2021-11-23 14:12:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:17,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:17,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:17,311 INFO L87 Difference]: Start difference. First operand 273 states and 385 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:17,361 INFO L93 Difference]: Finished difference Result 761 states and 1085 transitions. [2021-11-23 14:12:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-23 14:12:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:17,367 INFO L225 Difference]: With dead ends: 761 [2021-11-23 14:12:17,367 INFO L226 Difference]: Without dead ends: 505 [2021-11-23 14:12:17,368 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:17,380 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 316 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:17,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 763 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-11-23 14:12:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 310. [2021-11-23 14:12:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 291 states have (on average 1.5085910652920962) internal successors, (439), 309 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 439 transitions. [2021-11-23 14:12:17,409 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 439 transitions. Word has length 57 [2021-11-23 14:12:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:17,410 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 439 transitions. [2021-11-23 14:12:17,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 439 transitions. [2021-11-23 14:12:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-23 14:12:17,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:17,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:17,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 14:12:17,414 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1132119876, now seen corresponding path program 1 times [2021-11-23 14:12:17,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:17,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043268894] [2021-11-23 14:12:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:17,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:17,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:17,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043268894] [2021-11-23 14:12:17,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043268894] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:17,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:17,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:17,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033471742] [2021-11-23 14:12:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:17,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:17,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:17,519 INFO L87 Difference]: Start difference. First operand 310 states and 439 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:17,579 INFO L93 Difference]: Finished difference Result 850 states and 1215 transitions. [2021-11-23 14:12:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:17,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-23 14:12:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:17,585 INFO L225 Difference]: With dead ends: 850 [2021-11-23 14:12:17,586 INFO L226 Difference]: Without dead ends: 557 [2021-11-23 14:12:17,587 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:17,588 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 324 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:17,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 800 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-11-23 14:12:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 337. [2021-11-23 14:12:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 336 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 479 transitions. [2021-11-23 14:12:17,621 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 479 transitions. Word has length 58 [2021-11-23 14:12:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:17,626 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 479 transitions. [2021-11-23 14:12:17,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 479 transitions. [2021-11-23 14:12:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-23 14:12:17,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:17,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:17,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 14:12:17,640 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1812178246, now seen corresponding path program 1 times [2021-11-23 14:12:17,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:17,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536238226] [2021-11-23 14:12:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:17,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:17,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:17,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536238226] [2021-11-23 14:12:17,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536238226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:17,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:17,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:17,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871518687] [2021-11-23 14:12:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:17,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 14:12:17,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 14:12:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 14:12:17,743 INFO L87 Difference]: Start difference. First operand 337 states and 479 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:17,945 INFO L93 Difference]: Finished difference Result 1051 states and 1504 transitions. [2021-11-23 14:12:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 14:12:17,946 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-23 14:12:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:17,951 INFO L225 Difference]: With dead ends: 1051 [2021-11-23 14:12:17,951 INFO L226 Difference]: Without dead ends: 731 [2021-11-23 14:12:17,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 14:12:17,953 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 1243 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:17,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1041 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-11-23 14:12:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 439. [2021-11-23 14:12:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 420 states have (on average 1.4761904761904763) internal successors, (620), 438 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 620 transitions. [2021-11-23 14:12:17,978 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 620 transitions. Word has length 58 [2021-11-23 14:12:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:17,978 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 620 transitions. [2021-11-23 14:12:17,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 620 transitions. [2021-11-23 14:12:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-23 14:12:17,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:17,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:17,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 14:12:17,997 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799291, now seen corresponding path program 1 times [2021-11-23 14:12:17,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:17,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950226147] [2021-11-23 14:12:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:17,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:18,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:18,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950226147] [2021-11-23 14:12:18,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950226147] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:18,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:18,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:18,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368041453] [2021-11-23 14:12:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:18,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 14:12:18,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:18,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 14:12:18,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 14:12:18,136 INFO L87 Difference]: Start difference. First operand 439 states and 620 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:18,338 INFO L93 Difference]: Finished difference Result 1055 states and 1504 transitions. [2021-11-23 14:12:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 14:12:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-23 14:12:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:18,343 INFO L225 Difference]: With dead ends: 1055 [2021-11-23 14:12:18,344 INFO L226 Difference]: Without dead ends: 735 [2021-11-23 14:12:18,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-23 14:12:18,346 INFO L933 BasicCegarLoop]: 379 mSDtfsCounter, 1240 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:18,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1240 Valid, 1043 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-11-23 14:12:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 447. [2021-11-23 14:12:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 428 states have (on average 1.4672897196261683) internal successors, (628), 446 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 628 transitions. [2021-11-23 14:12:18,373 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 628 transitions. Word has length 59 [2021-11-23 14:12:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:18,374 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 628 transitions. [2021-11-23 14:12:18,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 628 transitions. [2021-11-23 14:12:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-23 14:12:18,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:18,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:18,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 14:12:18,378 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1774075593, now seen corresponding path program 1 times [2021-11-23 14:12:18,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:18,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548481511] [2021-11-23 14:12:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:18,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:18,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:18,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548481511] [2021-11-23 14:12:18,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548481511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:18,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:18,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:18,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548288493] [2021-11-23 14:12:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:18,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:18,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:18,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:18,514 INFO L87 Difference]: Start difference. First operand 447 states and 628 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:18,721 INFO L93 Difference]: Finished difference Result 1055 states and 1496 transitions. [2021-11-23 14:12:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:18,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-23 14:12:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:18,728 INFO L225 Difference]: With dead ends: 1055 [2021-11-23 14:12:18,728 INFO L226 Difference]: Without dead ends: 735 [2021-11-23 14:12:18,730 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:18,730 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 429 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:18,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 1041 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-11-23 14:12:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 447. [2021-11-23 14:12:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 428 states have (on average 1.4579439252336448) internal successors, (624), 446 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 624 transitions. [2021-11-23 14:12:18,761 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 624 transitions. Word has length 61 [2021-11-23 14:12:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:18,761 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 624 transitions. [2021-11-23 14:12:18,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 624 transitions. [2021-11-23 14:12:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-23 14:12:18,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:18,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:18,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 14:12:18,764 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1125522668, now seen corresponding path program 1 times [2021-11-23 14:12:18,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:18,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987159054] [2021-11-23 14:12:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:18,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:18,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:18,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987159054] [2021-11-23 14:12:18,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987159054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:18,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:18,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:18,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214119915] [2021-11-23 14:12:18,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:18,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:18,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:18,849 INFO L87 Difference]: Start difference. First operand 447 states and 624 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:18,893 INFO L93 Difference]: Finished difference Result 903 states and 1283 transitions. [2021-11-23 14:12:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:18,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-23 14:12:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:18,898 INFO L225 Difference]: With dead ends: 903 [2021-11-23 14:12:18,898 INFO L226 Difference]: Without dead ends: 583 [2021-11-23 14:12:18,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:18,900 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 281 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:18,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 666 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-11-23 14:12:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 442. [2021-11-23 14:12:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 424 states have (on average 1.4528301886792452) internal successors, (616), 441 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 616 transitions. [2021-11-23 14:12:18,929 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 616 transitions. Word has length 62 [2021-11-23 14:12:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:18,930 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 616 transitions. [2021-11-23 14:12:18,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 616 transitions. [2021-11-23 14:12:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 14:12:18,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:18,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:18,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 14:12:18,932 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1634877804, now seen corresponding path program 1 times [2021-11-23 14:12:18,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:18,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087331118] [2021-11-23 14:12:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:18,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:19,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:19,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087331118] [2021-11-23 14:12:19,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087331118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:19,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:19,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:19,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8299257] [2021-11-23 14:12:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:19,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:19,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:19,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:19,007 INFO L87 Difference]: Start difference. First operand 442 states and 616 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:19,082 INFO L93 Difference]: Finished difference Result 902 states and 1282 transitions. [2021-11-23 14:12:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:19,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-23 14:12:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:19,087 INFO L225 Difference]: With dead ends: 902 [2021-11-23 14:12:19,087 INFO L226 Difference]: Without dead ends: 587 [2021-11-23 14:12:19,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:19,089 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 244 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:19,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 653 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-11-23 14:12:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 422. [2021-11-23 14:12:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 408 states have (on average 1.4313725490196079) internal successors, (584), 421 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 584 transitions. [2021-11-23 14:12:19,121 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 584 transitions. Word has length 66 [2021-11-23 14:12:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:19,121 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 584 transitions. [2021-11-23 14:12:19,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 584 transitions. [2021-11-23 14:12:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 14:12:19,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:19,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:19,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 14:12:19,123 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1283339452, now seen corresponding path program 1 times [2021-11-23 14:12:19,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:19,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095834693] [2021-11-23 14:12:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:19,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:19,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095834693] [2021-11-23 14:12:19,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095834693] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:19,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:19,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:19,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107591322] [2021-11-23 14:12:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:19,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:19,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:19,188 INFO L87 Difference]: Start difference. First operand 422 states and 584 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:19,250 INFO L93 Difference]: Finished difference Result 870 states and 1226 transitions. [2021-11-23 14:12:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 14:12:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:19,254 INFO L225 Difference]: With dead ends: 870 [2021-11-23 14:12:19,254 INFO L226 Difference]: Without dead ends: 575 [2021-11-23 14:12:19,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:19,256 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 187 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:19,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 725 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-23 14:12:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 410. [2021-11-23 14:12:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.4221105527638191) internal successors, (566), 409 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 566 transitions. [2021-11-23 14:12:19,285 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 566 transitions. Word has length 70 [2021-11-23 14:12:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:19,285 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 566 transitions. [2021-11-23 14:12:19,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 566 transitions. [2021-11-23 14:12:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 14:12:19,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:19,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:19,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 14:12:19,288 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:19,288 INFO L85 PathProgramCache]: Analyzing trace with hash -843167330, now seen corresponding path program 1 times [2021-11-23 14:12:19,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:19,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852393339] [2021-11-23 14:12:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:19,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:19,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:19,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852393339] [2021-11-23 14:12:19,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852393339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:19,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:19,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:19,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523214512] [2021-11-23 14:12:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:19,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:19,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:19,391 INFO L87 Difference]: Start difference. First operand 410 states and 566 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:19,470 INFO L93 Difference]: Finished difference Result 866 states and 1218 transitions. [2021-11-23 14:12:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:19,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-23 14:12:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:19,475 INFO L225 Difference]: With dead ends: 866 [2021-11-23 14:12:19,475 INFO L226 Difference]: Without dead ends: 583 [2021-11-23 14:12:19,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:19,477 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 220 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:19,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 676 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-11-23 14:12:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 390. [2021-11-23 14:12:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 382 states have (on average 1.3979057591623036) internal successors, (534), 389 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 534 transitions. [2021-11-23 14:12:19,506 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 534 transitions. Word has length 71 [2021-11-23 14:12:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:19,506 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 534 transitions. [2021-11-23 14:12:19,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 534 transitions. [2021-11-23 14:12:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-23 14:12:19,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:19,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:19,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 14:12:19,509 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 619188056, now seen corresponding path program 1 times [2021-11-23 14:12:19,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:19,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066213254] [2021-11-23 14:12:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:19,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:19,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:19,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066213254] [2021-11-23 14:12:19,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066213254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:19,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:19,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:12:19,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223403248] [2021-11-23 14:12:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:19,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:19,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:19,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:19,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:12:19,720 INFO L87 Difference]: Start difference. First operand 390 states and 534 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:19,952 INFO L93 Difference]: Finished difference Result 1175 states and 1630 transitions. [2021-11-23 14:12:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:12:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-23 14:12:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:19,958 INFO L225 Difference]: With dead ends: 1175 [2021-11-23 14:12:19,958 INFO L226 Difference]: Without dead ends: 912 [2021-11-23 14:12:19,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-23 14:12:19,961 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 887 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:19,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 1702 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-11-23 14:12:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 444. [2021-11-23 14:12:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 436 states have (on average 1.389908256880734) internal successors, (606), 443 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 606 transitions. [2021-11-23 14:12:20,001 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 606 transitions. Word has length 76 [2021-11-23 14:12:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:20,001 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 606 transitions. [2021-11-23 14:12:20,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 606 transitions. [2021-11-23 14:12:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-23 14:12:20,003 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:20,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:20,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 14:12:20,005 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1601756427, now seen corresponding path program 1 times [2021-11-23 14:12:20,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:20,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262617672] [2021-11-23 14:12:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:20,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:20,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:20,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262617672] [2021-11-23 14:12:20,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262617672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:20,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:20,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:20,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392301397] [2021-11-23 14:12:20,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:20,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:20,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:20,097 INFO L87 Difference]: Start difference. First operand 444 states and 606 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:20,175 INFO L93 Difference]: Finished difference Result 906 states and 1259 transitions. [2021-11-23 14:12:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-23 14:12:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:20,180 INFO L225 Difference]: With dead ends: 906 [2021-11-23 14:12:20,180 INFO L226 Difference]: Without dead ends: 626 [2021-11-23 14:12:20,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:20,181 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 196 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:20,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 687 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-11-23 14:12:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 428. [2021-11-23 14:12:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 422 states have (on average 1.3744075829383886) internal successors, (580), 427 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 580 transitions. [2021-11-23 14:12:20,218 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 580 transitions. Word has length 77 [2021-11-23 14:12:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:20,218 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 580 transitions. [2021-11-23 14:12:20,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 580 transitions. [2021-11-23 14:12:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-23 14:12:20,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:20,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:20,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 14:12:20,221 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash -722176209, now seen corresponding path program 1 times [2021-11-23 14:12:20,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:20,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873226734] [2021-11-23 14:12:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:20,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:20,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873226734] [2021-11-23 14:12:20,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873226734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:20,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:20,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:20,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500991362] [2021-11-23 14:12:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:20,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:20,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:20,302 INFO L87 Difference]: Start difference. First operand 428 states and 580 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:20,359 INFO L93 Difference]: Finished difference Result 763 states and 1053 transitions. [2021-11-23 14:12:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-23 14:12:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:20,363 INFO L225 Difference]: With dead ends: 763 [2021-11-23 14:12:20,363 INFO L226 Difference]: Without dead ends: 512 [2021-11-23 14:12:20,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:20,369 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 132 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:20,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 555 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-11-23 14:12:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 424. [2021-11-23 14:12:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.3675417661097853) internal successors, (573), 423 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 573 transitions. [2021-11-23 14:12:20,407 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 573 transitions. Word has length 77 [2021-11-23 14:12:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:20,407 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 573 transitions. [2021-11-23 14:12:20,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 573 transitions. [2021-11-23 14:12:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 14:12:20,409 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:20,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:20,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 14:12:20,410 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1677165002, now seen corresponding path program 1 times [2021-11-23 14:12:20,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:20,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946384963] [2021-11-23 14:12:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:20,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:20,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:20,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946384963] [2021-11-23 14:12:20,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946384963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:20,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:20,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 14:12:20,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139186768] [2021-11-23 14:12:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:20,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 14:12:20,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 14:12:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 14:12:20,560 INFO L87 Difference]: Start difference. First operand 424 states and 573 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:20,977 INFO L93 Difference]: Finished difference Result 1454 states and 1994 transitions. [2021-11-23 14:12:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:12:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-23 14:12:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:20,986 INFO L225 Difference]: With dead ends: 1454 [2021-11-23 14:12:20,986 INFO L226 Difference]: Without dead ends: 1189 [2021-11-23 14:12:20,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-23 14:12:20,989 INFO L933 BasicCegarLoop]: 732 mSDtfsCounter, 1214 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:20,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 2846 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 14:12:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2021-11-23 14:12:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 452. [2021-11-23 14:12:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.3534675615212528) internal successors, (605), 451 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 605 transitions. [2021-11-23 14:12:21,049 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 605 transitions. Word has length 80 [2021-11-23 14:12:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:21,050 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 605 transitions. [2021-11-23 14:12:21,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 605 transitions. [2021-11-23 14:12:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-23 14:12:21,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:21,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:21,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 14:12:21,053 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1666481282, now seen corresponding path program 1 times [2021-11-23 14:12:21,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:21,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853711328] [2021-11-23 14:12:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:21,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:21,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:21,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853711328] [2021-11-23 14:12:21,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853711328] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:21,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:21,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:21,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100124499] [2021-11-23 14:12:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:21,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:21,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:21,123 INFO L87 Difference]: Start difference. First operand 452 states and 605 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:21,281 INFO L93 Difference]: Finished difference Result 1148 states and 1552 transitions. [2021-11-23 14:12:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:21,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-23 14:12:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:21,287 INFO L225 Difference]: With dead ends: 1148 [2021-11-23 14:12:21,288 INFO L226 Difference]: Without dead ends: 877 [2021-11-23 14:12:21,289 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:21,290 INFO L933 BasicCegarLoop]: 481 mSDtfsCounter, 548 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:21,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 1127 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2021-11-23 14:12:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 679. [2021-11-23 14:12:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 674 states have (on average 1.3367952522255193) internal successors, (901), 678 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 901 transitions. [2021-11-23 14:12:21,370 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 901 transitions. Word has length 80 [2021-11-23 14:12:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:21,371 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 901 transitions. [2021-11-23 14:12:21,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 901 transitions. [2021-11-23 14:12:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-23 14:12:21,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:21,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:21,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 14:12:21,374 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash 5651457, now seen corresponding path program 1 times [2021-11-23 14:12:21,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:21,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440713770] [2021-11-23 14:12:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:21,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:21,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:21,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440713770] [2021-11-23 14:12:21,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440713770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:21,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:21,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:12:21,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810135001] [2021-11-23 14:12:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:21,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:21,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:12:21,496 INFO L87 Difference]: Start difference. First operand 679 states and 901 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:21,818 INFO L93 Difference]: Finished difference Result 2048 states and 2799 transitions. [2021-11-23 14:12:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:12:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-23 14:12:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:21,828 INFO L225 Difference]: With dead ends: 2048 [2021-11-23 14:12:21,829 INFO L226 Difference]: Without dead ends: 1659 [2021-11-23 14:12:21,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-23 14:12:21,831 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 1014 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:21,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1014 Valid, 2269 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2021-11-23 14:12:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 667. [2021-11-23 14:12:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 662 states have (on average 1.3398791540785497) internal successors, (887), 666 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 887 transitions. [2021-11-23 14:12:21,932 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 887 transitions. Word has length 81 [2021-11-23 14:12:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:21,933 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 887 transitions. [2021-11-23 14:12:21,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 887 transitions. [2021-11-23 14:12:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-23 14:12:21,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:21,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:21,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 14:12:21,935 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2119956680, now seen corresponding path program 1 times [2021-11-23 14:12:21,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:21,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366477392] [2021-11-23 14:12:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:21,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:22,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:22,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366477392] [2021-11-23 14:12:22,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366477392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:22,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:22,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:22,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356333014] [2021-11-23 14:12:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:22,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:22,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:22,014 INFO L87 Difference]: Start difference. First operand 667 states and 887 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:22,168 INFO L93 Difference]: Finished difference Result 1042 states and 1409 transitions. [2021-11-23 14:12:22,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:22,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-23 14:12:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:22,176 INFO L225 Difference]: With dead ends: 1042 [2021-11-23 14:12:22,176 INFO L226 Difference]: Without dead ends: 1040 [2021-11-23 14:12:22,177 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:22,177 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 328 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:22,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 1085 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-11-23 14:12:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 669. [2021-11-23 14:12:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 664 states have (on average 1.338855421686747) internal successors, (889), 668 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 889 transitions. [2021-11-23 14:12:22,255 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 889 transitions. Word has length 81 [2021-11-23 14:12:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:22,255 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 889 transitions. [2021-11-23 14:12:22,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 889 transitions. [2021-11-23 14:12:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 14:12:22,257 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:22,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:22,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 14:12:22,258 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -738786262, now seen corresponding path program 1 times [2021-11-23 14:12:22,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:22,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888779384] [2021-11-23 14:12:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:22,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:22,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:22,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888779384] [2021-11-23 14:12:22,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888779384] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:22,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:22,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:12:22,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484563068] [2021-11-23 14:12:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:22,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:22,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:22,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:12:22,334 INFO L87 Difference]: Start difference. First operand 669 states and 889 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:22,560 INFO L93 Difference]: Finished difference Result 1596 states and 2219 transitions. [2021-11-23 14:12:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:12:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 14:12:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:22,568 INFO L225 Difference]: With dead ends: 1596 [2021-11-23 14:12:22,568 INFO L226 Difference]: Without dead ends: 1205 [2021-11-23 14:12:22,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-23 14:12:22,571 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 662 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:22,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 1569 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2021-11-23 14:12:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 675. [2021-11-23 14:12:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 670 states have (on average 1.335820895522388) internal successors, (895), 674 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 895 transitions. [2021-11-23 14:12:22,658 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 895 transitions. Word has length 82 [2021-11-23 14:12:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:22,659 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 895 transitions. [2021-11-23 14:12:22,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 895 transitions. [2021-11-23 14:12:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-23 14:12:22,660 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:22,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:22,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 14:12:22,661 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1934160205, now seen corresponding path program 1 times [2021-11-23 14:12:22,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:22,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664889056] [2021-11-23 14:12:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:22,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:22,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:22,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664889056] [2021-11-23 14:12:22,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664889056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:22,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:22,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:12:22,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89706440] [2021-11-23 14:12:22,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:22,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:22,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:22,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:12:22,782 INFO L87 Difference]: Start difference. First operand 675 states and 895 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:23,322 INFO L93 Difference]: Finished difference Result 2585 states and 3462 transitions. [2021-11-23 14:12:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:12:23,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-11-23 14:12:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:23,335 INFO L225 Difference]: With dead ends: 2585 [2021-11-23 14:12:23,335 INFO L226 Difference]: Without dead ends: 2165 [2021-11-23 14:12:23,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-23 14:12:23,339 INFO L933 BasicCegarLoop]: 561 mSDtfsCounter, 1515 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:23,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 2261 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2021-11-23 14:12:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 720. [2021-11-23 14:12:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 715 states have (on average 1.3300699300699301) internal successors, (951), 719 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 951 transitions. [2021-11-23 14:12:23,444 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 951 transitions. Word has length 82 [2021-11-23 14:12:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:23,445 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 951 transitions. [2021-11-23 14:12:23,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 951 transitions. [2021-11-23 14:12:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-23 14:12:23,446 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:23,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:23,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 14:12:23,447 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash -227333390, now seen corresponding path program 1 times [2021-11-23 14:12:23,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:23,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774465315] [2021-11-23 14:12:23,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:23,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:23,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:23,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774465315] [2021-11-23 14:12:23,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774465315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:23,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:23,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:23,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030277502] [2021-11-23 14:12:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:23,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:23,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:23,500 INFO L87 Difference]: Start difference. First operand 720 states and 951 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:23,732 INFO L93 Difference]: Finished difference Result 1850 states and 2458 transitions. [2021-11-23 14:12:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-23 14:12:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:23,741 INFO L225 Difference]: With dead ends: 1850 [2021-11-23 14:12:23,741 INFO L226 Difference]: Without dead ends: 1395 [2021-11-23 14:12:23,743 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:23,745 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 596 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:23,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 1177 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2021-11-23 14:12:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 975. [2021-11-23 14:12:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 970 states have (on average 1.324742268041237) internal successors, (1285), 974 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1285 transitions. [2021-11-23 14:12:23,861 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1285 transitions. Word has length 83 [2021-11-23 14:12:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:23,862 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1285 transitions. [2021-11-23 14:12:23,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1285 transitions. [2021-11-23 14:12:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-23 14:12:23,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:23,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:23,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 14:12:23,864 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1842213378, now seen corresponding path program 1 times [2021-11-23 14:12:23,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:23,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754162913] [2021-11-23 14:12:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:23,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:23,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754162913] [2021-11-23 14:12:23,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754162913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:23,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:23,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:23,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617534765] [2021-11-23 14:12:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:23,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:23,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:23,924 INFO L87 Difference]: Start difference. First operand 975 states and 1285 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:24,179 INFO L93 Difference]: Finished difference Result 2225 states and 2941 transitions. [2021-11-23 14:12:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:24,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-23 14:12:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:24,189 INFO L225 Difference]: With dead ends: 2225 [2021-11-23 14:12:24,189 INFO L226 Difference]: Without dead ends: 1595 [2021-11-23 14:12:24,190 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:24,191 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 542 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:24,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 1163 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-11-23 14:12:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2021-11-23 14:12:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1284 states have (on average 1.3161993769470406) internal successors, (1690), 1288 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1690 transitions. [2021-11-23 14:12:24,344 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1690 transitions. Word has length 83 [2021-11-23 14:12:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:24,344 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 1690 transitions. [2021-11-23 14:12:24,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1690 transitions. [2021-11-23 14:12:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-23 14:12:24,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:24,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:24,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 14:12:24,347 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash -188981192, now seen corresponding path program 1 times [2021-11-23 14:12:24,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:24,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870316592] [2021-11-23 14:12:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:24,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:24,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:24,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870316592] [2021-11-23 14:12:24,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870316592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:24,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:24,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 14:12:24,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45916832] [2021-11-23 14:12:24,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:24,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 14:12:24,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 14:12:24,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 14:12:24,389 INFO L87 Difference]: Start difference. First operand 1289 states and 1690 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:24,723 INFO L93 Difference]: Finished difference Result 3135 states and 4115 transitions. [2021-11-23 14:12:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 14:12:24,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-23 14:12:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:24,736 INFO L225 Difference]: With dead ends: 3135 [2021-11-23 14:12:24,736 INFO L226 Difference]: Without dead ends: 2127 [2021-11-23 14:12:24,738 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:24,739 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 236 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:24,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 685 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2021-11-23 14:12:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1291. [2021-11-23 14:12:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1286 states have (on average 1.3157076205287714) internal successors, (1692), 1290 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1692 transitions. [2021-11-23 14:12:24,911 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1692 transitions. Word has length 84 [2021-11-23 14:12:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:24,911 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1692 transitions. [2021-11-23 14:12:24,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1692 transitions. [2021-11-23 14:12:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-23 14:12:24,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:24,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:24,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 14:12:24,914 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash 366824125, now seen corresponding path program 1 times [2021-11-23 14:12:24,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:24,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344474687] [2021-11-23 14:12:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:24,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:24,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344474687] [2021-11-23 14:12:24,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344474687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:24,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:24,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:24,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551337682] [2021-11-23 14:12:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:24,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:24,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:24,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:24,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:24,976 INFO L87 Difference]: Start difference. First operand 1291 states and 1692 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:25,247 INFO L93 Difference]: Finished difference Result 2660 states and 3490 transitions. [2021-11-23 14:12:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-23 14:12:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:25,255 INFO L225 Difference]: With dead ends: 2660 [2021-11-23 14:12:25,255 INFO L226 Difference]: Without dead ends: 1450 [2021-11-23 14:12:25,256 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:25,257 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 446 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:25,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 758 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-11-23 14:12:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1082. [2021-11-23 14:12:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1077 states have (on average 1.3129062209842155) internal successors, (1414), 1081 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1414 transitions. [2021-11-23 14:12:25,410 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1414 transitions. Word has length 85 [2021-11-23 14:12:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:25,410 INFO L470 AbstractCegarLoop]: Abstraction has 1082 states and 1414 transitions. [2021-11-23 14:12:25,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1414 transitions. [2021-11-23 14:12:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-23 14:12:25,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:25,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:25,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 14:12:25,415 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1131184926, now seen corresponding path program 1 times [2021-11-23 14:12:25,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:25,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603844270] [2021-11-23 14:12:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:25,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:25,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:25,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603844270] [2021-11-23 14:12:25,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603844270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:25,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:25,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:25,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766163802] [2021-11-23 14:12:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:25,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:25,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:25,491 INFO L87 Difference]: Start difference. First operand 1082 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:25,738 INFO L93 Difference]: Finished difference Result 2483 states and 3257 transitions. [2021-11-23 14:12:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-23 14:12:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:25,747 INFO L225 Difference]: With dead ends: 2483 [2021-11-23 14:12:25,747 INFO L226 Difference]: Without dead ends: 1506 [2021-11-23 14:12:25,749 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:25,750 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 355 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:25,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 778 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2021-11-23 14:12:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1023. [2021-11-23 14:12:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.3074656188605107) internal successors, (1331), 1022 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1331 transitions. [2021-11-23 14:12:25,894 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1331 transitions. Word has length 86 [2021-11-23 14:12:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:25,894 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1331 transitions. [2021-11-23 14:12:25,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1331 transitions. [2021-11-23 14:12:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-23 14:12:25,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:25,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:25,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 14:12:25,899 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1364184419, now seen corresponding path program 1 times [2021-11-23 14:12:25,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:25,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786915750] [2021-11-23 14:12:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:25,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:26,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:26,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786915750] [2021-11-23 14:12:26,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786915750] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:26,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088680711] [2021-11-23 14:12:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:26,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:26,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:26,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:26,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 14:12:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:26,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 14:12:26,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 14:12:26,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 14:12:26,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088680711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:26,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 14:12:26,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-11-23 14:12:26,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805467038] [2021-11-23 14:12:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:26,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:26,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-23 14:12:26,710 INFO L87 Difference]: Start difference. First operand 1023 states and 1331 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:27,178 INFO L93 Difference]: Finished difference Result 2662 states and 3590 transitions. [2021-11-23 14:12:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:12:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2021-11-23 14:12:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:27,189 INFO L225 Difference]: With dead ends: 2662 [2021-11-23 14:12:27,190 INFO L226 Difference]: Without dead ends: 1834 [2021-11-23 14:12:27,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-23 14:12:27,192 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 510 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:27,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 1758 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2021-11-23 14:12:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1023. [2021-11-23 14:12:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.306483300589391) internal successors, (1330), 1022 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1330 transitions. [2021-11-23 14:12:27,350 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1330 transitions. Word has length 136 [2021-11-23 14:12:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:27,350 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1330 transitions. [2021-11-23 14:12:27,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1330 transitions. [2021-11-23 14:12:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-23 14:12:27,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:27,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:27,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:27,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 14:12:27,576 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash -917711074, now seen corresponding path program 1 times [2021-11-23 14:12:27,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77334216] [2021-11-23 14:12:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:27,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:27,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:27,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77334216] [2021-11-23 14:12:27,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77334216] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:27,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608045514] [2021-11-23 14:12:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:27,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:27,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:27,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:27,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 14:12:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:27,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 14:12:27,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:28,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:28,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608045514] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:28,706 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:28,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-11-23 14:12:28,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115804192] [2021-11-23 14:12:28,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:28,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 14:12:28,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:28,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 14:12:28,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-23 14:12:28,709 INFO L87 Difference]: Start difference. First operand 1023 states and 1330 transitions. Second operand has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:39,149 INFO L93 Difference]: Finished difference Result 17145 states and 22807 transitions. [2021-11-23 14:12:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2021-11-23 14:12:39,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-11-23 14:12:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:39,207 INFO L225 Difference]: With dead ends: 17145 [2021-11-23 14:12:39,208 INFO L226 Difference]: Without dead ends: 16323 [2021-11-23 14:12:39,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28981 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8529, Invalid=55733, Unknown=0, NotChecked=0, Total=64262 [2021-11-23 14:12:39,243 INFO L933 BasicCegarLoop]: 927 mSDtfsCounter, 16807 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16807 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:39,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16807 Valid, 6573 Invalid, 2758 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [301 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-23 14:12:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16323 states. [2021-11-23 14:12:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16323 to 2761. [2021-11-23 14:12:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2756 states have (on average 1.3062409288824384) internal successors, (3600), 2760 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3600 transitions. [2021-11-23 14:12:39,901 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3600 transitions. Word has length 140 [2021-11-23 14:12:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:39,902 INFO L470 AbstractCegarLoop]: Abstraction has 2761 states and 3600 transitions. [2021-11-23 14:12:39,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3600 transitions. [2021-11-23 14:12:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-23 14:12:39,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:39,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-11-23 14:12:39,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:40,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:40,136 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 981860325, now seen corresponding path program 1 times [2021-11-23 14:12:40,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:40,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285396617] [2021-11-23 14:12:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:40,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:40,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285396617] [2021-11-23 14:12:40,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285396617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62332789] [2021-11-23 14:12:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:40,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:40,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:40,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 14:12:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:40,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 14:12:40,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:40,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:41,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62332789] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:41,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:41,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2021-11-23 14:12:41,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909037270] [2021-11-23 14:12:41,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:41,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 14:12:41,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:41,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 14:12:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-23 14:12:41,303 INFO L87 Difference]: Start difference. First operand 2761 states and 3600 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:43,001 INFO L93 Difference]: Finished difference Result 10046 states and 13634 transitions. [2021-11-23 14:12:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-23 14:12:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2021-11-23 14:12:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:43,018 INFO L225 Difference]: With dead ends: 10046 [2021-11-23 14:12:43,018 INFO L226 Difference]: Without dead ends: 7520 [2021-11-23 14:12:43,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-11-23 14:12:43,024 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 3225 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3225 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:43,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3225 Valid, 2947 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 14:12:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2021-11-23 14:12:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 2375. [2021-11-23 14:12:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2370 states have (on average 1.3075949367088608) internal successors, (3099), 2374 states have internal predecessors, (3099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3099 transitions. [2021-11-23 14:12:43,389 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3099 transitions. Word has length 141 [2021-11-23 14:12:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:43,389 INFO L470 AbstractCegarLoop]: Abstraction has 2375 states and 3099 transitions. [2021-11-23 14:12:43,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3099 transitions. [2021-11-23 14:12:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-23 14:12:43,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:43,396 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:43,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:43,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 14:12:43,624 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1562784706, now seen corresponding path program 1 times [2021-11-23 14:12:43,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150066263] [2021-11-23 14:12:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:43,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-23 14:12:43,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:43,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150066263] [2021-11-23 14:12:43,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150066263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:43,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:43,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 14:12:43,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730719419] [2021-11-23 14:12:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:43,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 14:12:43,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 14:12:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 14:12:43,753 INFO L87 Difference]: Start difference. First operand 2375 states and 3099 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:45,784 INFO L93 Difference]: Finished difference Result 13667 states and 18165 transitions. [2021-11-23 14:12:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-23 14:12:45,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2021-11-23 14:12:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:45,807 INFO L225 Difference]: With dead ends: 13667 [2021-11-23 14:12:45,807 INFO L226 Difference]: Without dead ends: 11547 [2021-11-23 14:12:45,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-11-23 14:12:45,813 INFO L933 BasicCegarLoop]: 989 mSDtfsCounter, 1607 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:45,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1607 Valid, 4505 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 14:12:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11547 states. [2021-11-23 14:12:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11547 to 2807. [2021-11-23 14:12:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2802 states have (on average 1.2876516773733049) internal successors, (3608), 2806 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3608 transitions. [2021-11-23 14:12:46,220 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3608 transitions. Word has length 142 [2021-11-23 14:12:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:46,220 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 3608 transitions. [2021-11-23 14:12:46,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3608 transitions. [2021-11-23 14:12:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-23 14:12:46,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:46,228 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:46,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-23 14:12:46,228 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash 956899568, now seen corresponding path program 1 times [2021-11-23 14:12:46,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:46,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593348710] [2021-11-23 14:12:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:46,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 14:12:46,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:46,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593348710] [2021-11-23 14:12:46,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593348710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:46,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:46,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:12:46,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211302909] [2021-11-23 14:12:46,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:46,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:46,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:12:46,371 INFO L87 Difference]: Start difference. First operand 2807 states and 3608 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:47,427 INFO L93 Difference]: Finished difference Result 9217 states and 12245 transitions. [2021-11-23 14:12:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:12:47,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2021-11-23 14:12:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:47,439 INFO L225 Difference]: With dead ends: 9217 [2021-11-23 14:12:47,440 INFO L226 Difference]: Without dead ends: 6605 [2021-11-23 14:12:47,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-23 14:12:47,444 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 763 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:47,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 2369 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6605 states. [2021-11-23 14:12:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6605 to 2807. [2021-11-23 14:12:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2802 states have (on average 1.286224125624554) internal successors, (3604), 2806 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3604 transitions. [2021-11-23 14:12:47,937 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3604 transitions. Word has length 144 [2021-11-23 14:12:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:47,938 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 3604 transitions. [2021-11-23 14:12:47,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3604 transitions. [2021-11-23 14:12:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-23 14:12:47,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:47,945 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:47,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-23 14:12:47,945 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash -508874859, now seen corresponding path program 1 times [2021-11-23 14:12:47,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:47,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896378139] [2021-11-23 14:12:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:47,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 14:12:48,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896378139] [2021-11-23 14:12:48,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896378139] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:48,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:48,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:12:48,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81398110] [2021-11-23 14:12:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:48,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:12:48,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:12:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:12:48,087 INFO L87 Difference]: Start difference. First operand 2807 states and 3604 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:49,086 INFO L93 Difference]: Finished difference Result 8283 states and 10861 transitions. [2021-11-23 14:12:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 14:12:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-11-23 14:12:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:49,095 INFO L225 Difference]: With dead ends: 8283 [2021-11-23 14:12:49,095 INFO L226 Difference]: Without dead ends: 5671 [2021-11-23 14:12:49,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-23 14:12:49,100 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 589 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:49,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 1874 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2021-11-23 14:12:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 2807. [2021-11-23 14:12:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2802 states have (on average 1.284796573875803) internal successors, (3600), 2806 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3600 transitions. [2021-11-23 14:12:49,513 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3600 transitions. Word has length 148 [2021-11-23 14:12:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:49,513 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 3600 transitions. [2021-11-23 14:12:49,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3600 transitions. [2021-11-23 14:12:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 14:12:49,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:49,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:49,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 14:12:49,521 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -763848025, now seen corresponding path program 1 times [2021-11-23 14:12:49,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:49,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527139115] [2021-11-23 14:12:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:49,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-23 14:12:49,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:49,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527139115] [2021-11-23 14:12:49,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527139115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:49,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:49,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:49,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574169001] [2021-11-23 14:12:49,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:49,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:12:49,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:49,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:12:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:12:49,639 INFO L87 Difference]: Start difference. First operand 2807 states and 3600 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:49,946 INFO L93 Difference]: Finished difference Result 4594 states and 5926 transitions. [2021-11-23 14:12:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 14:12:49,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2021-11-23 14:12:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:49,949 INFO L225 Difference]: With dead ends: 4594 [2021-11-23 14:12:49,949 INFO L226 Difference]: Without dead ends: 1934 [2021-11-23 14:12:49,951 INFO L932 BasicCegarLoop]: 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 [2021-11-23 14:12:49,952 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:49,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 800 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:12:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2021-11-23 14:12:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2021-11-23 14:12:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1929 states have (on average 1.2820114048729911) internal successors, (2473), 1933 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2473 transitions. [2021-11-23 14:12:50,201 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2473 transitions. Word has length 151 [2021-11-23 14:12:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:50,201 INFO L470 AbstractCegarLoop]: Abstraction has 1934 states and 2473 transitions. [2021-11-23 14:12:50,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2473 transitions. [2021-11-23 14:12:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 14:12:50,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:50,205 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:50,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-23 14:12:50,205 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1350527935, now seen corresponding path program 1 times [2021-11-23 14:12:50,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:50,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93942154] [2021-11-23 14:12:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:50,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:50,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93942154] [2021-11-23 14:12:50,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93942154] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:50,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457475218] [2021-11-23 14:12:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:50,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:50,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:50,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 14:12:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:50,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 14:12:50,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:51,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:51,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457475218] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:51,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:51,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2021-11-23 14:12:51,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422899974] [2021-11-23 14:12:51,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:51,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-23 14:12:51,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:51,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-23 14:12:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-11-23 14:12:51,880 INFO L87 Difference]: Start difference. First operand 1934 states and 2473 transitions. Second operand has 25 states, 25 states have (on average 12.56) internal successors, (314), 24 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:56,549 INFO L93 Difference]: Finished difference Result 6522 states and 8437 transitions. [2021-11-23 14:12:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-23 14:12:56,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.56) internal successors, (314), 24 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2021-11-23 14:12:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:56,553 INFO L225 Difference]: With dead ends: 6522 [2021-11-23 14:12:56,554 INFO L226 Difference]: Without dead ends: 4790 [2021-11-23 14:12:56,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3209 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1745, Invalid=8355, Unknown=0, NotChecked=0, Total=10100 [2021-11-23 14:12:56,559 INFO L933 BasicCegarLoop]: 806 mSDtfsCounter, 4303 mSDsluCounter, 7717 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 8523 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:56,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4303 Valid, 8523 Invalid, 3517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-23 14:12:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2021-11-23 14:12:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 2360. [2021-11-23 14:12:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2355 states have (on average 1.2772823779193205) internal successors, (3008), 2359 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3008 transitions. [2021-11-23 14:12:57,016 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3008 transitions. Word has length 151 [2021-11-23 14:12:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:57,016 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 3008 transitions. [2021-11-23 14:12:57,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.56) internal successors, (314), 24 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3008 transitions. [2021-11-23 14:12:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-23 14:12:57,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:57,020 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:12:57,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 14:12:57,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-23 14:12:57,222 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash 578404291, now seen corresponding path program 1 times [2021-11-23 14:12:57,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:57,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659826674] [2021-11-23 14:12:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:57,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-23 14:12:57,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:57,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659826674] [2021-11-23 14:12:57,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659826674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:12:57,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:12:57,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:12:57,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085657523] [2021-11-23 14:12:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:12:57,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 14:12:57,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 14:12:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-23 14:12:57,311 INFO L87 Difference]: Start difference. First operand 2360 states and 3008 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:12:57,805 INFO L93 Difference]: Finished difference Result 4451 states and 5716 transitions. [2021-11-23 14:12:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 14:12:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2021-11-23 14:12:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:12:57,808 INFO L225 Difference]: With dead ends: 4451 [2021-11-23 14:12:57,809 INFO L226 Difference]: Without dead ends: 2229 [2021-11-23 14:12:57,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-23 14:12:57,816 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 461 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:12:57,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 440 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:12:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2021-11-23 14:12:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2228. [2021-11-23 14:12:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2223 states have (on average 1.2793522267206479) internal successors, (2844), 2227 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2844 transitions. [2021-11-23 14:12:58,177 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2844 transitions. Word has length 151 [2021-11-23 14:12:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:12:58,177 INFO L470 AbstractCegarLoop]: Abstraction has 2228 states and 2844 transitions. [2021-11-23 14:12:58,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:12:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2844 transitions. [2021-11-23 14:12:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-23 14:12:58,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:12:58,182 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:12:58,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-23 14:12:58,182 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:12:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:12:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 943893716, now seen corresponding path program 1 times [2021-11-23 14:12:58,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:12:58,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750659281] [2021-11-23 14:12:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:58,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:12:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:58,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:12:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750659281] [2021-11-23 14:12:58,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750659281] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:12:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532429651] [2021-11-23 14:12:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:12:58,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:12:58,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:12:58,404 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:12:58,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 14:12:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:12:58,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 14:12:58,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:12:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:59,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:12:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:12:59,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532429651] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:12:59,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:12:59,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2021-11-23 14:12:59,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103886131] [2021-11-23 14:12:59,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:12:59,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-23 14:12:59,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:12:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-23 14:12:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-11-23 14:12:59,908 INFO L87 Difference]: Start difference. First operand 2228 states and 2844 transitions. Second operand has 25 states, 25 states have (on average 13.32) internal successors, (333), 24 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:06,543 INFO L93 Difference]: Finished difference Result 9142 states and 11776 transitions. [2021-11-23 14:13:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-11-23 14:13:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 13.32) internal successors, (333), 24 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-11-23 14:13:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:06,553 INFO L225 Difference]: With dead ends: 9142 [2021-11-23 14:13:06,553 INFO L226 Difference]: Without dead ends: 7115 [2021-11-23 14:13:06,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 285 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5175 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2929, Invalid=12821, Unknown=0, NotChecked=0, Total=15750 [2021-11-23 14:13:06,559 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 4555 mSDsluCounter, 7847 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4555 SdHoareTripleChecker+Valid, 8707 SdHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:06,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4555 Valid, 8707 Invalid, 4267 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [78 Valid, 4189 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-23 14:13:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2021-11-23 14:13:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 2860. [2021-11-23 14:13:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2855 states have (on average 1.2770577933450087) internal successors, (3646), 2859 states have internal predecessors, (3646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3646 transitions. [2021-11-23 14:13:07,130 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3646 transitions. Word has length 152 [2021-11-23 14:13:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:13:07,130 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3646 transitions. [2021-11-23 14:13:07,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.32) internal successors, (333), 24 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3646 transitions. [2021-11-23 14:13:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-23 14:13:07,135 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:13:07,135 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:13:07,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 14:13:07,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-23 14:13:07,361 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:13:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:13:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1349187310, now seen corresponding path program 1 times [2021-11-23 14:13:07,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:13:07,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559295697] [2021-11-23 14:13:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:07,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:13:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 14:13:07,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:13:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559295697] [2021-11-23 14:13:07,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559295697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:13:07,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:13:07,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:13:07,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360803938] [2021-11-23 14:13:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:13:07,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:13:07,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:13:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:13:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:13:07,423 INFO L87 Difference]: Start difference. First operand 2860 states and 3646 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:07,958 INFO L93 Difference]: Finished difference Result 5263 states and 6752 transitions. [2021-11-23 14:13:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 14:13:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-11-23 14:13:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:07,961 INFO L225 Difference]: With dead ends: 5263 [2021-11-23 14:13:07,961 INFO L226 Difference]: Without dead ends: 2545 [2021-11-23 14:13:07,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:13:07,964 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 209 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:07,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 478 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:13:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2021-11-23 14:13:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2537. [2021-11-23 14:13:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2532 states have (on average 1.2768562401263823) internal successors, (3233), 2536 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3233 transitions. [2021-11-23 14:13:08,337 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3233 transitions. Word has length 152 [2021-11-23 14:13:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:13:08,338 INFO L470 AbstractCegarLoop]: Abstraction has 2537 states and 3233 transitions. [2021-11-23 14:13:08,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3233 transitions. [2021-11-23 14:13:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-11-23 14:13:08,342 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:13:08,342 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:13:08,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-23 14:13:08,343 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:13:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:13:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash -997799864, now seen corresponding path program 1 times [2021-11-23 14:13:08,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:13:08,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152490238] [2021-11-23 14:13:08,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:08,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:13:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 14:13:08,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:13:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152490238] [2021-11-23 14:13:08,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152490238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:13:08,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:13:08,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:13:08,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349176803] [2021-11-23 14:13:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:13:08,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:13:08,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:13:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:13:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:13:08,419 INFO L87 Difference]: Start difference. First operand 2537 states and 3233 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:10,505 INFO L93 Difference]: Finished difference Result 12285 states and 15890 transitions. [2021-11-23 14:13:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 14:13:10,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-11-23 14:13:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:10,515 INFO L225 Difference]: With dead ends: 12285 [2021-11-23 14:13:10,515 INFO L226 Difference]: Without dead ends: 9950 [2021-11-23 14:13:10,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-11-23 14:13:10,519 INFO L933 BasicCegarLoop]: 743 mSDtfsCounter, 1143 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:10,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1143 Valid, 3080 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:13:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9950 states. [2021-11-23 14:13:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9950 to 3410. [2021-11-23 14:13:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3405 states have (on average 1.2546255506607928) internal successors, (4272), 3409 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 4272 transitions. [2021-11-23 14:13:11,233 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 4272 transitions. Word has length 152 [2021-11-23 14:13:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:13:11,234 INFO L470 AbstractCegarLoop]: Abstraction has 3410 states and 4272 transitions. [2021-11-23 14:13:11,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 4272 transitions. [2021-11-23 14:13:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 14:13:11,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:13:11,238 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:13:11,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-23 14:13:11,238 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:13:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:13:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash -101089402, now seen corresponding path program 1 times [2021-11-23 14:13:11,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:13:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107860291] [2021-11-23 14:13:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:11,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:13:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:11,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:13:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107860291] [2021-11-23 14:13:11,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107860291] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:13:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660459113] [2021-11-23 14:13:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:11,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:13:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:13:11,608 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:13:11,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 14:13:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:11,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 14:13:11,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:13:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:12,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:13:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:13,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660459113] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:13:13,986 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:13:13,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 9] total 21 [2021-11-23 14:13:13,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953235033] [2021-11-23 14:13:13,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:13:13,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-23 14:13:13,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:13:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-23 14:13:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-11-23 14:13:13,988 INFO L87 Difference]: Start difference. First operand 3410 states and 4272 transitions. Second operand has 22 states, 22 states have (on average 17.272727272727273) internal successors, (380), 21 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:16,527 INFO L93 Difference]: Finished difference Result 10209 states and 13026 transitions. [2021-11-23 14:13:16,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-23 14:13:16,535 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 17.272727272727273) internal successors, (380), 21 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-11-23 14:13:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:16,541 INFO L225 Difference]: With dead ends: 10209 [2021-11-23 14:13:16,541 INFO L226 Difference]: Without dead ends: 7001 [2021-11-23 14:13:16,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 292 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=643, Invalid=1907, Unknown=0, NotChecked=0, Total=2550 [2021-11-23 14:13:16,545 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 3865 mSDsluCounter, 4662 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3865 SdHoareTripleChecker+Valid, 5400 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:16,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3865 Valid, 5400 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-23 14:13:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2021-11-23 14:13:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 2924. [2021-11-23 14:13:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2919 states have (on average 1.2490578965399108) internal successors, (3646), 2923 states have internal predecessors, (3646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3646 transitions. [2021-11-23 14:13:17,099 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3646 transitions. Word has length 153 [2021-11-23 14:13:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:13:17,099 INFO L470 AbstractCegarLoop]: Abstraction has 2924 states and 3646 transitions. [2021-11-23 14:13:17,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 17.272727272727273) internal successors, (380), 21 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3646 transitions. [2021-11-23 14:13:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 14:13:17,102 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:13:17,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:13:17,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 14:13:17,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-23 14:13:17,306 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:13:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:13:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1756195445, now seen corresponding path program 1 times [2021-11-23 14:13:17,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:13:17,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325951698] [2021-11-23 14:13:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:17,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:13:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:17,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:13:17,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325951698] [2021-11-23 14:13:17,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325951698] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:13:17,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37718265] [2021-11-23 14:13:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:17,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:13:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:13:17,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:13:17,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 14:13:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:17,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 14:13:17,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:13:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:17,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:13:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:18,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37718265] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:13:18,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:13:18,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2021-11-23 14:13:18,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926897471] [2021-11-23 14:13:18,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:13:18,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-23 14:13:18,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:13:18,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-23 14:13:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-23 14:13:18,174 INFO L87 Difference]: Start difference. First operand 2924 states and 3646 transitions. Second operand has 16 states, 16 states have (on average 18.375) internal successors, (294), 16 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:31,934 INFO L93 Difference]: Finished difference Result 36006 states and 45900 transitions. [2021-11-23 14:13:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2021-11-23 14:13:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.375) internal successors, (294), 16 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-11-23 14:13:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:31,964 INFO L225 Difference]: With dead ends: 36006 [2021-11-23 14:13:31,965 INFO L226 Difference]: Without dead ends: 29940 [2021-11-23 14:13:31,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27821 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8045, Invalid=54705, Unknown=0, NotChecked=0, Total=62750 [2021-11-23 14:13:31,980 INFO L933 BasicCegarLoop]: 1077 mSDtfsCounter, 9375 mSDsluCounter, 8574 mSDsCounter, 0 mSdLazyCounter, 3059 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9375 SdHoareTripleChecker+Valid, 9651 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 3059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:31,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9375 Valid, 9651 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 3059 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-23 14:13:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29940 states. [2021-11-23 14:13:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29940 to 6169. [2021-11-23 14:13:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6169 states, 6164 states have (on average 1.246593121349773) internal successors, (7684), 6168 states have internal predecessors, (7684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 7684 transitions. [2021-11-23 14:13:33,418 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 7684 transitions. Word has length 153 [2021-11-23 14:13:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:13:33,419 INFO L470 AbstractCegarLoop]: Abstraction has 6169 states and 7684 transitions. [2021-11-23 14:13:33,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.375) internal successors, (294), 16 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 7684 transitions. [2021-11-23 14:13:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-23 14:13:33,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:13:33,423 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:13:33,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 14:13:33,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-23 14:13:33,624 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:13:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:13:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2016713999, now seen corresponding path program 1 times [2021-11-23 14:13:33,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:13:33,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709121726] [2021-11-23 14:13:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:33,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:13:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:33,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:13:33,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709121726] [2021-11-23 14:13:33,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709121726] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:13:33,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118244536] [2021-11-23 14:13:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:33,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:13:33,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:13:33,733 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:13:33,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 14:13:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:33,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-23 14:13:33,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:13:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:34,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:13:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:13:34,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118244536] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:13:34,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:13:34,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 14 [2021-11-23 14:13:34,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705270186] [2021-11-23 14:13:34,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:13:34,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 14:13:34,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:13:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 14:13:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-23 14:13:34,703 INFO L87 Difference]: Start difference. First operand 6169 states and 7684 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:51,070 INFO L93 Difference]: Finished difference Result 71509 states and 92372 transitions. [2021-11-23 14:13:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2021-11-23 14:13:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-11-23 14:13:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:51,139 INFO L225 Difference]: With dead ends: 71509 [2021-11-23 14:13:51,139 INFO L226 Difference]: Without dead ends: 65602 [2021-11-23 14:13:51,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11887 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4408, Invalid=25348, Unknown=0, NotChecked=0, Total=29756 [2021-11-23 14:13:51,154 INFO L933 BasicCegarLoop]: 1423 mSDtfsCounter, 3003 mSDsluCounter, 12612 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3003 SdHoareTripleChecker+Valid, 14035 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:51,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3003 Valid, 14035 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-23 14:13:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65602 states. [2021-11-23 14:13:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65602 to 16300. [2021-11-23 14:13:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16300 states, 16295 states have (on average 1.2767106474378644) internal successors, (20804), 16299 states have internal predecessors, (20804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16300 states to 16300 states and 20804 transitions. [2021-11-23 14:13:54,440 INFO L78 Accepts]: Start accepts. Automaton has 16300 states and 20804 transitions. Word has length 154 [2021-11-23 14:13:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:13:54,440 INFO L470 AbstractCegarLoop]: Abstraction has 16300 states and 20804 transitions. [2021-11-23 14:13:54,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16300 states and 20804 transitions. [2021-11-23 14:13:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-23 14:13:54,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:13:54,448 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:13:54,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 14:13:54,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:13:54,649 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:13:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:13:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash -276367027, now seen corresponding path program 1 times [2021-11-23 14:13:54,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:13:54,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744857067] [2021-11-23 14:13:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:13:54,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:13:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:13:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 14:13:54,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:13:54,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744857067] [2021-11-23 14:13:54,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744857067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:13:54,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:13:54,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 14:13:54,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896769483] [2021-11-23 14:13:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:13:54,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 14:13:54,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:13:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 14:13:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:13:54,696 INFO L87 Difference]: Start difference. First operand 16300 states and 20804 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:13:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:13:57,592 INFO L93 Difference]: Finished difference Result 29272 states and 37659 transitions. [2021-11-23 14:13:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 14:13:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2021-11-23 14:13:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:13:57,605 INFO L225 Difference]: With dead ends: 29272 [2021-11-23 14:13:57,605 INFO L226 Difference]: Without dead ends: 13234 [2021-11-23 14:13:57,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 14:13:57,619 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 218 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:13:57,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 447 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:13:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13234 states. [2021-11-23 14:14:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13234 to 12646. [2021-11-23 14:14:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12646 states, 12641 states have (on average 1.287951902539356) internal successors, (16281), 12645 states have internal predecessors, (16281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12646 states to 12646 states and 16281 transitions. [2021-11-23 14:14:00,042 INFO L78 Accepts]: Start accepts. Automaton has 12646 states and 16281 transitions. Word has length 154 [2021-11-23 14:14:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:14:00,042 INFO L470 AbstractCegarLoop]: Abstraction has 12646 states and 16281 transitions. [2021-11-23 14:14:00,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 12646 states and 16281 transitions. [2021-11-23 14:14:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-23 14:14:00,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:14:00,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:14:00,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-23 14:14:00,050 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:14:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:14:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1366202968, now seen corresponding path program 1 times [2021-11-23 14:14:00,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:14:00,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572469731] [2021-11-23 14:14:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:14:00,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:14:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:14:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:14:00,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:14:00,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572469731] [2021-11-23 14:14:00,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572469731] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:14:00,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393538448] [2021-11-23 14:14:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:14:00,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:14:00,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:14:00,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:14:00,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 14:14:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:14:00,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 14:14:00,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:14:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:14:00,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 14:14:00,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393538448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:14:00,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 14:14:00,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2021-11-23 14:14:00,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476055434] [2021-11-23 14:14:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:14:00,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 14:14:00,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:14:00,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 14:14:00,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-23 14:14:00,628 INFO L87 Difference]: Start difference. First operand 12646 states and 16281 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:14:07,357 INFO L93 Difference]: Finished difference Result 44226 states and 57709 transitions. [2021-11-23 14:14:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 14:14:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-11-23 14:14:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:14:07,385 INFO L225 Difference]: With dead ends: 44226 [2021-11-23 14:14:07,385 INFO L226 Difference]: Without dead ends: 29526 [2021-11-23 14:14:07,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-11-23 14:14:07,392 INFO L933 BasicCegarLoop]: 1271 mSDtfsCounter, 1120 mSDsluCounter, 5743 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 7014 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 14:14:07,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1120 Valid, 7014 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 14:14:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29526 states. [2021-11-23 14:14:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29526 to 9957. [2021-11-23 14:14:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9957 states, 9952 states have (on average 1.2806471061093248) internal successors, (12745), 9956 states have internal predecessors, (12745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9957 states to 9957 states and 12745 transitions. [2021-11-23 14:14:09,307 INFO L78 Accepts]: Start accepts. Automaton has 9957 states and 12745 transitions. Word has length 156 [2021-11-23 14:14:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:14:09,308 INFO L470 AbstractCegarLoop]: Abstraction has 9957 states and 12745 transitions. [2021-11-23 14:14:09,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 9957 states and 12745 transitions. [2021-11-23 14:14:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-23 14:14:09,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:14:09,315 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:14:09,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-23 14:14:09,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:14:09,528 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:14:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:14:09,529 INFO L85 PathProgramCache]: Analyzing trace with hash -715052546, now seen corresponding path program 1 times [2021-11-23 14:14:09,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:14:09,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219354452] [2021-11-23 14:14:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:14:09,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:14:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:14:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:14:09,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:14:09,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219354452] [2021-11-23 14:14:09,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219354452] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 14:14:09,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969830809] [2021-11-23 14:14:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:14:09,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:14:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 14:14:09,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 14:14:09,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 14:14:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:14:09,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 14:14:09,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 14:14:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:14:10,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 14:14:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 14:14:10,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969830809] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 14:14:10,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 14:14:10,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2021-11-23 14:14:10,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711101081] [2021-11-23 14:14:10,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 14:14:10,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 14:14:10,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:14:10,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 14:14:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 14:14:10,273 INFO L87 Difference]: Start difference. First operand 9957 states and 12745 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:14:15,043 INFO L93 Difference]: Finished difference Result 33295 states and 42730 transitions. [2021-11-23 14:14:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 14:14:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-11-23 14:14:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:14:15,066 INFO L225 Difference]: With dead ends: 33295 [2021-11-23 14:14:15,066 INFO L226 Difference]: Without dead ends: 23533 [2021-11-23 14:14:15,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-11-23 14:14:15,073 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 1091 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 14:14:15,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1671 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 14:14:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23533 states. [2021-11-23 14:14:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23533 to 12966. [2021-11-23 14:14:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12966 states, 12961 states have (on average 1.2664146285008873) internal successors, (16414), 12965 states have internal predecessors, (16414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12966 states to 12966 states and 16414 transitions. [2021-11-23 14:14:17,776 INFO L78 Accepts]: Start accepts. Automaton has 12966 states and 16414 transitions. Word has length 157 [2021-11-23 14:14:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:14:17,777 INFO L470 AbstractCegarLoop]: Abstraction has 12966 states and 16414 transitions. [2021-11-23 14:14:17,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12966 states and 16414 transitions. [2021-11-23 14:14:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 14:14:17,782 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:14:17,783 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:14:17,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 14:14:17,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 14:14:17,983 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:14:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:14:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2087706448, now seen corresponding path program 1 times [2021-11-23 14:14:17,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:14:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376717664] [2021-11-23 14:14:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:14:17,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:14:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 14:14:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 14:14:18,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 14:14:18,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376717664] [2021-11-23 14:14:18,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376717664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 14:14:18,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 14:14:18,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 14:14:18,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780207186] [2021-11-23 14:14:18,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 14:14:18,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 14:14:18,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 14:14:18,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 14:14:18,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 14:14:18,099 INFO L87 Difference]: Start difference. First operand 12966 states and 16414 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 14:14:23,928 INFO L93 Difference]: Finished difference Result 36693 states and 46961 transitions. [2021-11-23 14:14:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 14:14:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2021-11-23 14:14:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 14:14:23,957 INFO L225 Difference]: With dead ends: 36693 [2021-11-23 14:14:23,957 INFO L226 Difference]: Without dead ends: 26919 [2021-11-23 14:14:23,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-23 14:14:23,968 INFO L933 BasicCegarLoop]: 749 mSDtfsCounter, 1237 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 14:14:23,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1237 Valid, 2542 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 14:14:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26919 states. [2021-11-23 14:14:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26919 to 13042. [2021-11-23 14:14:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13042 states, 13037 states have (on average 1.2652450717189538) internal successors, (16495), 13041 states have internal predecessors, (16495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13042 states to 13042 states and 16495 transitions. [2021-11-23 14:14:26,679 INFO L78 Accepts]: Start accepts. Automaton has 13042 states and 16495 transitions. Word has length 158 [2021-11-23 14:14:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 14:14:26,679 INFO L470 AbstractCegarLoop]: Abstraction has 13042 states and 16495 transitions. [2021-11-23 14:14:26,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 14:14:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13042 states and 16495 transitions. [2021-11-23 14:14:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 14:14:26,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 14:14:26,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 14:14:26,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-23 14:14:26,684 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 20 more)] === [2021-11-23 14:14:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 14:14:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1249048133, now seen corresponding path program 1 times [2021-11-23 14:14:26,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 14:14:26,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080110123] [2021-11-23 14:14:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 14:14:26,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 14:14:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:14:26,742 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 14:14:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 14:14:26,884 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 14:14:26,884 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 14:14:26,885 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (22 of 23 remaining) [2021-11-23 14:14:26,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 23 remaining) [2021-11-23 14:14:26,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (20 of 23 remaining) [2021-11-23 14:14:26,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (19 of 23 remaining) [2021-11-23 14:14:26,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (18 of 23 remaining) [2021-11-23 14:14:26,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (17 of 23 remaining) [2021-11-23 14:14:26,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (16 of 23 remaining) [2021-11-23 14:14:26,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 23 remaining) [2021-11-23 14:14:26,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (14 of 23 remaining) [2021-11-23 14:14:26,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (13 of 23 remaining) [2021-11-23 14:14:26,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (12 of 23 remaining) [2021-11-23 14:14:26,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (11 of 23 remaining) [2021-11-23 14:14:26,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (10 of 23 remaining) [2021-11-23 14:14:26,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (9 of 23 remaining) [2021-11-23 14:14:26,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (8 of 23 remaining) [2021-11-23 14:14:26,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (7 of 23 remaining) [2021-11-23 14:14:26,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (6 of 23 remaining) [2021-11-23 14:14:26,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (5 of 23 remaining) [2021-11-23 14:14:26,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (4 of 23 remaining) [2021-11-23 14:14:26,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (3 of 23 remaining) [2021-11-23 14:14:26,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (2 of 23 remaining) [2021-11-23 14:14:26,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (1 of 23 remaining) [2021-11-23 14:14:26,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (0 of 23 remaining) [2021-11-23 14:14:26,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-23 14:14:26,895 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 14:14:26,899 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 14:14:27,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:14:27 BoogieIcfgContainer [2021-11-23 14:14:27,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 14:14:27,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 14:14:27,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 14:14:27,108 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 14:14:27,108 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:12:15" (3/4) ... [2021-11-23 14:14:27,110 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 14:14:27,382 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 14:14:27,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 14:14:27,383 INFO L158 Benchmark]: Toolchain (without parser) took 133333.96ms. Allocated memory was 136.3MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 114.4MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2021-11-23 14:14:27,383 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 136.3MB. Free memory was 93.0MB in the beginning and 92.9MB in the end (delta: 70.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 14:14:27,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.01ms. Allocated memory is still 136.3MB. Free memory was 113.9MB in the beginning and 104.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 14:14:27,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.75ms. Allocated memory is still 136.3MB. Free memory was 104.7MB in the beginning and 100.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 14:14:27,384 INFO L158 Benchmark]: Boogie Preprocessor took 90.20ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 96.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 14:14:27,385 INFO L158 Benchmark]: RCFGBuilder took 1151.35ms. Allocated memory is still 136.3MB. Free memory was 96.3MB in the beginning and 58.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-11-23 14:14:27,385 INFO L158 Benchmark]: TraceAbstraction took 131235.03ms. Allocated memory was 136.3MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 58.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2021-11-23 14:14:27,386 INFO L158 Benchmark]: Witness Printer took 275.22ms. Allocated memory is still 3.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2021-11-23 14:14:27,397 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 136.3MB. Free memory was 93.0MB in the beginning and 92.9MB in the end (delta: 70.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.01ms. Allocated memory is still 136.3MB. Free memory was 113.9MB in the beginning and 104.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.75ms. Allocated memory is still 136.3MB. Free memory was 104.7MB in the beginning and 100.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.20ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 96.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1151.35ms. Allocated memory is still 136.3MB. Free memory was 96.3MB in the beginning and 58.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 131235.03ms. Allocated memory was 136.3MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 58.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 275.22ms. Allocated memory is still 3.5GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-127, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-127] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-127, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-127] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-127, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-127] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-127] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L386] CALL, EXPR read_active_side_history((unsigned char)0) [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, index=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L616] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L386] CALL, EXPR read_active_side_history((unsigned char)0) [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-127, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 [L490] CALL, EXPR read_active_side_history((unsigned char)0) [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-127, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 301 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 130.9s, OverallIterations: 46, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 90.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67517 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67517 mSDsluCounter, 111229 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86951 mSDsCounter, 1056 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18887 IncrementalHoareTripleChecker+Invalid, 19943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1056 mSolverCounterUnsat, 24278 mSDtfsCounter, 18887 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4228 GetRequests, 3034 SyntacticMatches, 15 SemanticMatches, 1179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78087 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16300occurred in iteration=41, InterpolantAutomatonStates: 1147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.9s AutomataMinimizationTime, 45 MinimizatonAttempts, 179353 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 6315 NumberOfCodeBlocks, 6315 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7294 ConstructedInterpolants, 0 QuantifiedInterpolants, 29436 SizeOfPredicates, 53 NumberOfNonLiveVariables, 7563 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 63 InterpolantComputations, 37 PerfectInterpolantSequences, 1073/1645 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-23 14:14:27,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c22933-81e4-46e3-85fd-11f3b5d3dde7/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE