./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:48:01,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:48:01,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:48:01,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:48:01,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:48:01,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:48:01,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:48:01,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:48:01,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:48:01,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:48:01,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:48:01,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:48:01,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:48:01,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:48:01,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:48:01,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:48:01,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:48:01,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:48:01,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:48:01,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:48:01,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:48:01,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:48:01,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:48:01,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:48:01,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:48:01,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:48:01,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:48:01,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:48:01,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:48:01,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:48:01,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:48:01,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:48:01,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:48:01,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:48:01,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:48:01,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:48:01,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:48:01,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:48:01,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:48:01,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:48:01,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:48:01,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:48:01,526 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:48:01,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:48:01,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:48:01,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:48:01,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:48:01,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:48:01,534 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:48:01,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:48:01,535 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:48:01,535 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:48:01,536 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:48:01,536 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:48:01,536 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:48:01,536 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:48:01,537 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:48:01,537 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:48:01,537 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:48:01,537 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:48:01,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:48:01,540 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:48:01,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:48:01,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:48:01,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:48:01,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:48:01,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:48:01,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:48:01,543 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:48:01,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:48:01,543 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:48:01,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:48:01,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:48:01,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:48:01,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:48:01,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:48:01,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:48:01,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:48:01,545 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:48:01,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:48:01,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:48:01,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:48:01,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:48:01,546 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/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_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2021-11-25 19:48:01,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:48:01,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:48:01,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:48:01,883 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:48:01,884 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:48:01,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2021-11-25 19:48:01,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/data/2327bc30b/0cf66c3ed9b0454b85c613f8c835ada1/FLAG34df336d1 [2021-11-25 19:48:02,484 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:48:02,485 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2021-11-25 19:48:02,495 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/data/2327bc30b/0cf66c3ed9b0454b85c613f8c835ada1/FLAG34df336d1 [2021-11-25 19:48:02,941 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/data/2327bc30b/0cf66c3ed9b0454b85c613f8c835ada1 [2021-11-25 19:48:02,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:48:02,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:48:02,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:48:02,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:48:02,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:48:02,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:48:02" (1/1) ... [2021-11-25 19:48:02,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e70b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:02, skipping insertion in model container [2021-11-25 19:48:02,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:48:02" (1/1) ... [2021-11-25 19:48:02,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:48:03,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:48:03,277 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_790dba4f-c831-4c3f-85a9-35edab100943/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2021-11-25 19:48:03,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:48:03,296 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:48:03,357 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_790dba4f-c831-4c3f-85a9-35edab100943/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2021-11-25 19:48:03,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:48:03,373 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:48:03,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03 WrapperNode [2021-11-25 19:48:03,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:48:03,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:48:03,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:48:03,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:48:03,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,483 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 538 [2021-11-25 19:48:03,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:48:03,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:48:03,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:48:03,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:48:03,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:48:03,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:48:03,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:48:03,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:48:03,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (1/1) ... [2021-11-25 19:48:03,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:48:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:48:03,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:48:03,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:48:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2021-11-25 19:48:03,654 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2021-11-25 19:48:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:48:03,654 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2021-11-25 19:48:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2021-11-25 19:48:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-11-25 19:48:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-11-25 19:48:03,655 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2021-11-25 19:48:03,655 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2021-11-25 19:48:03,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-25 19:48:03,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-25 19:48:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:48:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2021-11-25 19:48:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2021-11-25 19:48:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:48:03,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:48:03,657 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2021-11-25 19:48:03,658 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2021-11-25 19:48:03,762 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:48:03,763 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:48:04,411 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:48:04,683 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:48:04,684 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-25 19:48:04,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:48:04 BoogieIcfgContainer [2021-11-25 19:48:04,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:48:04,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:48:04,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:48:04,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:48:04,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:48:02" (1/3) ... [2021-11-25 19:48:04,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201fc524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:48:04, skipping insertion in model container [2021-11-25 19:48:04,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:48:03" (2/3) ... [2021-11-25 19:48:04,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201fc524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:48:04, skipping insertion in model container [2021-11-25 19:48:04,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:48:04" (3/3) ... [2021-11-25 19:48:04,696 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2021-11-25 19:48:04,702 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:48:04,702 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 19:48:04,751 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:48:04,759 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=FINITE_AUTOMATA, 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-25 19:48:04,760 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 19:48:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 111 states have internal predecessors, (169), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 19:48:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:48:04,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:04,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:04,799 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1166703025, now seen corresponding path program 1 times [2021-11-25 19:48:04,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:04,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226652897] [2021-11-25 19:48:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:04,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:05,163 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-25 19:48:05,164 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226652897] [2021-11-25 19:48:05,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226652897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:05,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:05,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:48:05,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363067512] [2021-11-25 19:48:05,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:05,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:48:05,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:48:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:48:05,210 INFO L87 Difference]: Start difference. First operand has 150 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 111 states have internal predecessors, (169), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 19:48:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:05,442 INFO L93 Difference]: Finished difference Result 301 states and 489 transitions. [2021-11-25 19:48:05,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:48:05,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-11-25 19:48:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:05,455 INFO L225 Difference]: With dead ends: 301 [2021-11-25 19:48:05,455 INFO L226 Difference]: Without dead ends: 153 [2021-11-25 19:48:05,460 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-25 19:48:05,464 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 5 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:05,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 626 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:48:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-25 19:48:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-11-25 19:48:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 113 states have internal predecessors, (170), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-11-25 19:48:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 232 transitions. [2021-11-25 19:48:05,521 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 232 transitions. Word has length 19 [2021-11-25 19:48:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:05,521 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 232 transitions. [2021-11-25 19:48:05,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-25 19:48:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 232 transitions. [2021-11-25 19:48:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 19:48:05,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:05,524 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:05,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:48:05,525 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1729445324, now seen corresponding path program 1 times [2021-11-25 19:48:05,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:05,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14453366] [2021-11-25 19:48:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:05,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:48:05,681 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14453366] [2021-11-25 19:48:05,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14453366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:05,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:05,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:48:05,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199586128] [2021-11-25 19:48:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:05,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:48:05,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:48:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:05,685 INFO L87 Difference]: Start difference. First operand 153 states and 232 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 19:48:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:05,996 INFO L93 Difference]: Finished difference Result 435 states and 675 transitions. [2021-11-25 19:48:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:48:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2021-11-25 19:48:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:06,004 INFO L225 Difference]: With dead ends: 435 [2021-11-25 19:48:06,005 INFO L226 Difference]: Without dead ends: 285 [2021-11-25 19:48:06,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-25 19:48:06,014 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 569 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:06,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 596 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:48:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-25 19:48:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2021-11-25 19:48:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2021-11-25 19:48:06,067 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 30 [2021-11-25 19:48:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:06,067 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2021-11-25 19:48:06,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 19:48:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2021-11-25 19:48:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:48:06,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:06,069 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:06,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 19:48:06,070 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1540164151, now seen corresponding path program 1 times [2021-11-25 19:48:06,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:06,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707046765] [2021-11-25 19:48:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:06,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:48:06,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:06,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707046765] [2021-11-25 19:48:06,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707046765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:06,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:06,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:48:06,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166834481] [2021-11-25 19:48:06,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:06,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:48:06,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:48:06,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:06,236 INFO L87 Difference]: Start difference. First operand 187 states and 282 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 19:48:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:06,500 INFO L93 Difference]: Finished difference Result 435 states and 673 transitions. [2021-11-25 19:48:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:48:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2021-11-25 19:48:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:06,504 INFO L225 Difference]: With dead ends: 435 [2021-11-25 19:48:06,504 INFO L226 Difference]: Without dead ends: 285 [2021-11-25 19:48:06,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-25 19:48:06,513 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 565 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:06,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 599 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:48:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-25 19:48:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2021-11-25 19:48:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2021-11-25 19:48:06,553 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 31 [2021-11-25 19:48:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:06,554 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2021-11-25 19:48:06,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 19:48:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2021-11-25 19:48:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-25 19:48:06,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:06,558 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:06,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 19:48:06,559 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1852556943, now seen corresponding path program 1 times [2021-11-25 19:48:06,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392292768] [2021-11-25 19:48:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:06,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:48:06,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:06,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392292768] [2021-11-25 19:48:06,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392292768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:06,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:06,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:48:06,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874770337] [2021-11-25 19:48:06,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:06,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:48:06,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:06,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:48:06,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:48:06,698 INFO L87 Difference]: Start difference. First operand 187 states and 281 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 19:48:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:06,782 INFO L93 Difference]: Finished difference Result 342 states and 516 transitions. [2021-11-25 19:48:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:48:06,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-11-25 19:48:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:06,786 INFO L225 Difference]: With dead ends: 342 [2021-11-25 19:48:06,786 INFO L226 Difference]: Without dead ends: 192 [2021-11-25 19:48:06,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:06,794 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:06,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 638 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:48:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-25 19:48:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-11-25 19:48:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 146 states have internal predecessors, (217), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2021-11-25 19:48:06,821 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 285 transitions. Word has length 33 [2021-11-25 19:48:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:06,821 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 285 transitions. [2021-11-25 19:48:06,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 19:48:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2021-11-25 19:48:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-25 19:48:06,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:06,827 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:06,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 19:48:06,828 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1321944341, now seen corresponding path program 1 times [2021-11-25 19:48:06,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:06,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950330268] [2021-11-25 19:48:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:06,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:48:06,971 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:06,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950330268] [2021-11-25 19:48:06,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950330268] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:06,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:06,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:48:06,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233408761] [2021-11-25 19:48:06,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:06,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:48:06,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:48:06,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:48:06,977 INFO L87 Difference]: Start difference. First operand 192 states and 285 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-25 19:48:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:07,053 INFO L93 Difference]: Finished difference Result 352 states and 527 transitions. [2021-11-25 19:48:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:48:07,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-11-25 19:48:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:07,058 INFO L225 Difference]: With dead ends: 352 [2021-11-25 19:48:07,059 INFO L226 Difference]: Without dead ends: 197 [2021-11-25 19:48:07,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:07,060 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 6 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:07,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 624 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:48:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-25 19:48:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-11-25 19:48:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 150 states have (on average 1.4733333333333334) internal successors, (221), 150 states have internal predecessors, (221), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2021-11-25 19:48:07,076 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 41 [2021-11-25 19:48:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:07,076 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2021-11-25 19:48:07,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-25 19:48:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2021-11-25 19:48:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 19:48:07,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:07,078 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:07,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 19:48:07,078 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1907041343, now seen corresponding path program 1 times [2021-11-25 19:48:07,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:07,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538580828] [2021-11-25 19:48:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:07,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:48:07,168 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:07,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538580828] [2021-11-25 19:48:07,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538580828] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:07,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:07,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:48:07,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441844151] [2021-11-25 19:48:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:07,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:48:07,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:07,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:48:07,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:48:07,171 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-25 19:48:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:07,241 INFO L93 Difference]: Finished difference Result 361 states and 531 transitions. [2021-11-25 19:48:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:48:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2021-11-25 19:48:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:07,245 INFO L225 Difference]: With dead ends: 361 [2021-11-25 19:48:07,246 INFO L226 Difference]: Without dead ends: 201 [2021-11-25 19:48:07,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:07,248 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 5 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:07,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 633 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:48:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-11-25 19:48:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-11-25 19:48:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2021-11-25 19:48:07,263 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 49 [2021-11-25 19:48:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:07,264 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2021-11-25 19:48:07,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-25 19:48:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2021-11-25 19:48:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 19:48:07,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:07,265 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:07,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:48:07,266 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:07,266 INFO L85 PathProgramCache]: Analyzing trace with hash 8533350, now seen corresponding path program 1 times [2021-11-25 19:48:07,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:07,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653415019] [2021-11-25 19:48:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:07,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:48:07,388 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:07,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653415019] [2021-11-25 19:48:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653415019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:07,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:07,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:48:07,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584790178] [2021-11-25 19:48:07,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:07,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:48:07,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:48:07,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:48:07,391 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-25 19:48:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:07,464 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2021-11-25 19:48:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:48:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2021-11-25 19:48:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:07,471 INFO L225 Difference]: With dead ends: 370 [2021-11-25 19:48:07,471 INFO L226 Difference]: Without dead ends: 206 [2021-11-25 19:48:07,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:07,473 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 6 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:07,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 624 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:48:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-25 19:48:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-11-25 19:48:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 157 states have internal predecessors, (228), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2021-11-25 19:48:07,487 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 49 [2021-11-25 19:48:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:07,488 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2021-11-25 19:48:07,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-25 19:48:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2021-11-25 19:48:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-25 19:48:07,489 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:07,490 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:07,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 19:48:07,490 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -311743642, now seen corresponding path program 1 times [2021-11-25 19:48:07,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:07,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610067017] [2021-11-25 19:48:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:07,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 19:48:07,587 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610067017] [2021-11-25 19:48:07,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610067017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:07,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:48:07,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:48:07,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513106272] [2021-11-25 19:48:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:07,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:48:07,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:48:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:48:07,590 INFO L87 Difference]: Start difference. First operand 206 states and 296 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-25 19:48:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:07,655 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2021-11-25 19:48:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:48:07,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-11-25 19:48:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:07,658 INFO L225 Difference]: With dead ends: 381 [2021-11-25 19:48:07,658 INFO L226 Difference]: Without dead ends: 212 [2021-11-25 19:48:07,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:48:07,660 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 7 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:07,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:48:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-25 19:48:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-11-25 19:48:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 162 states have internal predecessors, (233), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2021-11-25 19:48:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2021-11-25 19:48:07,674 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 57 [2021-11-25 19:48:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:07,675 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2021-11-25 19:48:07,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-25 19:48:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2021-11-25 19:48:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-25 19:48:07,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:07,677 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:07,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 19:48:07,677 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash -71883967, now seen corresponding path program 1 times [2021-11-25 19:48:07,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:07,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826798732] [2021-11-25 19:48:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:07,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:48:07,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826798732] [2021-11-25 19:48:07,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826798732] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:48:07,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030735252] [2021-11-25 19:48:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:07,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:48:07,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:48:07,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:48:07,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:48:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:08,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:48:08,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:48:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:48:08,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:48:08,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030735252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:08,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:48:08,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2021-11-25 19:48:08,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37280150] [2021-11-25 19:48:08,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:08,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:48:08,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:08,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:48:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:48:08,451 INFO L87 Difference]: Start difference. First operand 212 states and 301 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-25 19:48:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:08,704 INFO L93 Difference]: Finished difference Result 601 states and 839 transitions. [2021-11-25 19:48:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:48:08,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 60 [2021-11-25 19:48:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:08,708 INFO L225 Difference]: With dead ends: 601 [2021-11-25 19:48:08,708 INFO L226 Difference]: Without dead ends: 400 [2021-11-25 19:48:08,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-25 19:48:08,710 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 233 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:08,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1099 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:48:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-11-25 19:48:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2021-11-25 19:48:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 300 states have (on average 1.42) internal successors, (426), 301 states have internal predecessors, (426), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-11-25 19:48:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 556 transitions. [2021-11-25 19:48:08,738 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 556 transitions. Word has length 60 [2021-11-25 19:48:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:08,739 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 556 transitions. [2021-11-25 19:48:08,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-25 19:48:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 556 transitions. [2021-11-25 19:48:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-25 19:48:08,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:08,741 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:08,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:48:08,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:48:08,967 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:08,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -399936524, now seen corresponding path program 1 times [2021-11-25 19:48:08,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:08,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476432464] [2021-11-25 19:48:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:08,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:48:09,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:09,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476432464] [2021-11-25 19:48:09,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476432464] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:48:09,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430047724] [2021-11-25 19:48:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:09,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:48:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:48:09,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:48:09,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:48:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:09,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 19:48:09,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:48:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:48:09,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:48:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:48:09,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430047724] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:48:09,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2053002466] [2021-11-25 19:48:09,989 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2021-11-25 19:48:09,989 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 19:48:09,993 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 19:48:09,998 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 19:48:09,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 19:48:13,750 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 111 for LOIs [2021-11-25 19:48:13,905 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2021-11-25 19:48:13,923 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 104 for LOIs [2021-11-25 19:48:13,991 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 19:48:27,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [2053002466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:48:27,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:48:27,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [9, 9, 9] total 37 [2021-11-25 19:48:27,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389327795] [2021-11-25 19:48:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:48:27,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 19:48:27,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:48:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 19:48:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2021-11-25 19:48:27,307 INFO L87 Difference]: Start difference. First operand 396 states and 556 transitions. Second operand has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-25 19:48:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:48:32,513 INFO L93 Difference]: Finished difference Result 821 states and 1160 transitions. [2021-11-25 19:48:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:48:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2021-11-25 19:48:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:48:32,518 INFO L225 Difference]: With dead ends: 821 [2021-11-25 19:48:32,518 INFO L226 Difference]: Without dead ends: 465 [2021-11-25 19:48:32,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=155, Invalid=1405, Unknown=0, NotChecked=0, Total=1560 [2021-11-25 19:48:32,521 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 196 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:48:32,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 2625 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-25 19:48:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-11-25 19:48:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 442. [2021-11-25 19:48:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 331 states have (on average 1.3987915407854985) internal successors, (463), 332 states have internal predecessors, (463), 78 states have call successors, (78), 32 states have call predecessors, (78), 32 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2021-11-25 19:48:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 619 transitions. [2021-11-25 19:48:32,568 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 619 transitions. Word has length 62 [2021-11-25 19:48:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:48:32,569 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 619 transitions. [2021-11-25 19:48:32,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-25 19:48:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 619 transitions. [2021-11-25 19:48:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-25 19:48:32,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:48:32,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:48:32,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:48:32,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 19:48:32,779 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:48:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:48:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1021702805, now seen corresponding path program 1 times [2021-11-25 19:48:32,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:48:32,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571218711] [2021-11-25 19:48:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:32,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:48:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:48:32,948 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:48:32,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571218711] [2021-11-25 19:48:32,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571218711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:48:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764273033] [2021-11-25 19:48:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:48:32,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:48:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:48:32,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:48:32,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:48:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:48:33,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 19:48:33,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:48:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:48:33,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:48:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:48:33,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764273033] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:48:33,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [177917378] [2021-11-25 19:48:33,616 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2021-11-25 19:48:33,616 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 19:48:33,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 19:48:33,616 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 19:48:33,616 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 19:48:50,302 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-25 19:48:51,864 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2021-11-25 19:48:51,866 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2021-11-25 19:48:51,875 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 30 for LOIs [2021-11-25 19:48:51,889 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 26 for LOIs [2021-11-25 19:48:51,900 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-25 19:48:51,907 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 19:49:03,225 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10143#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~active_side_History_0~0 2) (not (= 2 ~active_side_History_0~0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)))' at error location [2021-11-25 19:49:03,225 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 19:49:03,225 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:49:03,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-25 19:49:03,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530662630] [2021-11-25 19:49:03,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:49:03,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 19:49:03,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:03,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 19:49:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2021-11-25 19:49:03,230 INFO L87 Difference]: Start difference. First operand 442 states and 619 transitions. Second operand has 13 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-25 19:49:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:03,920 INFO L93 Difference]: Finished difference Result 1158 states and 1633 transitions. [2021-11-25 19:49:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 19:49:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 62 [2021-11-25 19:49:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:03,928 INFO L225 Difference]: With dead ends: 1158 [2021-11-25 19:49:03,928 INFO L226 Difference]: Without dead ends: 799 [2021-11-25 19:49:03,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 130 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=277, Invalid=3383, Unknown=0, NotChecked=0, Total=3660 [2021-11-25 19:49:03,932 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 272 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:03,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 3133 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:49:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-11-25 19:49:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 497. [2021-11-25 19:49:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 370 states have (on average 1.3702702702702703) internal successors, (507), 373 states have internal predecessors, (507), 84 states have call successors, (84), 42 states have call predecessors, (84), 42 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2021-11-25 19:49:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 675 transitions. [2021-11-25 19:49:04,006 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 675 transitions. Word has length 62 [2021-11-25 19:49:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:04,011 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 675 transitions. [2021-11-25 19:49:04,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.444444444444445) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2021-11-25 19:49:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 675 transitions. [2021-11-25 19:49:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 19:49:04,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:04,013 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:49:04,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:49:04,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:49:04,227 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1308659894, now seen corresponding path program 1 times [2021-11-25 19:49:04,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:04,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444407250] [2021-11-25 19:49:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:04,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:49:04,314 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:04,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444407250] [2021-11-25 19:49:04,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444407250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:49:04,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:49:04,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:49:04,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658477175] [2021-11-25 19:49:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:49:04,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:49:04,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:49:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:49:04,316 INFO L87 Difference]: Start difference. First operand 497 states and 675 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 19:49:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:04,411 INFO L93 Difference]: Finished difference Result 907 states and 1237 transitions. [2021-11-25 19:49:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:49:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2021-11-25 19:49:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:04,416 INFO L225 Difference]: With dead ends: 907 [2021-11-25 19:49:04,416 INFO L226 Difference]: Without dead ends: 509 [2021-11-25 19:49:04,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:49:04,418 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 5 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:04,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 633 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:49:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-11-25 19:49:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2021-11-25 19:49:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 379 states have (on average 1.3614775725593669) internal successors, (516), 382 states have internal predecessors, (516), 84 states have call successors, (84), 45 states have call predecessors, (84), 45 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2021-11-25 19:49:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 684 transitions. [2021-11-25 19:49:04,470 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 684 transitions. Word has length 66 [2021-11-25 19:49:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:04,471 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 684 transitions. [2021-11-25 19:49:04,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 19:49:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 684 transitions. [2021-11-25 19:49:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 19:49:04,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:04,473 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:49:04,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 19:49:04,473 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -17388373, now seen corresponding path program 1 times [2021-11-25 19:49:04,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:04,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858633929] [2021-11-25 19:49:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:04,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 19:49:04,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:04,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858633929] [2021-11-25 19:49:04,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858633929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:49:04,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:49:04,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 19:49:04,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884568569] [2021-11-25 19:49:04,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:49:04,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:49:04,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:04,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:49:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:49:04,553 INFO L87 Difference]: Start difference. First operand 509 states and 684 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 19:49:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:04,728 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2021-11-25 19:49:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:49:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2021-11-25 19:49:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:04,734 INFO L225 Difference]: With dead ends: 642 [2021-11-25 19:49:04,734 INFO L226 Difference]: Without dead ends: 640 [2021-11-25 19:49:04,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:49:04,735 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 173 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:04,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1706 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:49:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2021-11-25 19:49:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 513. [2021-11-25 19:49:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 381 states have (on average 1.3595800524934383) internal successors, (518), 385 states have internal predecessors, (518), 85 states have call successors, (85), 46 states have call predecessors, (85), 46 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2021-11-25 19:49:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 688 transitions. [2021-11-25 19:49:04,790 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 688 transitions. Word has length 65 [2021-11-25 19:49:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:04,790 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 688 transitions. [2021-11-25 19:49:04,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 19:49:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 688 transitions. [2021-11-25 19:49:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-25 19:49:04,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:04,792 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:49:04,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 19:49:04,793 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 262723461, now seen corresponding path program 1 times [2021-11-25 19:49:04,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677508362] [2021-11-25 19:49:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:04,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 19:49:04,855 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677508362] [2021-11-25 19:49:04,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677508362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:49:04,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:49:04,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:49:04,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136196620] [2021-11-25 19:49:04,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:49:04,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:49:04,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:49:04,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:49:04,858 INFO L87 Difference]: Start difference. First operand 513 states and 688 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 19:49:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:04,945 INFO L93 Difference]: Finished difference Result 833 states and 1120 transitions. [2021-11-25 19:49:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:49:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2021-11-25 19:49:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:04,950 INFO L225 Difference]: With dead ends: 833 [2021-11-25 19:49:04,950 INFO L226 Difference]: Without dead ends: 507 [2021-11-25 19:49:04,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:49:04,952 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 7 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:04,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 625 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:49:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-11-25 19:49:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2021-11-25 19:49:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 378 states have (on average 1.3386243386243386) internal successors, (506), 382 states have internal predecessors, (506), 82 states have call successors, (82), 46 states have call predecessors, (82), 46 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2021-11-25 19:49:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 670 transitions. [2021-11-25 19:49:05,007 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 670 transitions. Word has length 68 [2021-11-25 19:49:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:05,008 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 670 transitions. [2021-11-25 19:49:05,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-25 19:49:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 670 transitions. [2021-11-25 19:49:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 19:49:05,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:05,010 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:49:05,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 19:49:05,010 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1200443003, now seen corresponding path program 1 times [2021-11-25 19:49:05,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:05,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000148187] [2021-11-25 19:49:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:05,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 19:49:05,296 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:05,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000148187] [2021-11-25 19:49:05,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000148187] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:49:05,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850570658] [2021-11-25 19:49:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:05,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:49:05,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:49:05,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:49:05,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:49:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:05,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 19:49:05,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:49:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:49:05,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:49:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 19:49:06,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850570658] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:49:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [203712276] [2021-11-25 19:49:06,064 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2021-11-25 19:49:06,064 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 19:49:06,065 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 19:49:06,065 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 19:49:06,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 19:49:22,241 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 174 for LOIs [2021-11-25 19:49:23,636 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 16 for LOIs [2021-11-25 19:49:23,638 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 30 for LOIs [2021-11-25 19:49:23,651 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 31 for LOIs [2021-11-25 19:49:23,662 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 25 for LOIs [2021-11-25 19:49:23,679 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 15 for LOIs [2021-11-25 19:49:23,685 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 19:49:36,799 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17954#(and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (not (= ~active_side_History_0~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= ~active_side_History_0~0 2) (not (= (mod ~side2Failed_History_1~0 256) 0)) (not (= ~manual_selection_History_1~0 0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (= (mod ~side1Failed_History_1~0 256) 0))' at error location [2021-11-25 19:49:36,800 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 19:49:36,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:49:36,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 20 [2021-11-25 19:49:36,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125412220] [2021-11-25 19:49:36,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:49:36,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:49:36,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:36,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:49:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3859, Unknown=0, NotChecked=0, Total=4160 [2021-11-25 19:49:36,803 INFO L87 Difference]: Start difference. First operand 507 states and 670 transitions. Second operand has 20 states, 15 states have (on average 6.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-25 19:49:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:37,986 INFO L93 Difference]: Finished difference Result 1131 states and 1557 transitions. [2021-11-25 19:49:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 19:49:37,987 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 6.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) Word has length 70 [2021-11-25 19:49:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:37,994 INFO L225 Difference]: With dead ends: 1131 [2021-11-25 19:49:37,994 INFO L226 Difference]: Without dead ends: 761 [2021-11-25 19:49:37,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 148 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=352, Invalid=4760, Unknown=0, NotChecked=0, Total=5112 [2021-11-25 19:49:38,000 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 596 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:38,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 4486 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-25 19:49:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-11-25 19:49:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 514. [2021-11-25 19:49:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 384 states have (on average 1.3333333333333333) internal successors, (512), 389 states have internal predecessors, (512), 80 states have call successors, (80), 49 states have call predecessors, (80), 49 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2021-11-25 19:49:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 672 transitions. [2021-11-25 19:49:38,064 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 672 transitions. Word has length 70 [2021-11-25 19:49:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:38,064 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 672 transitions. [2021-11-25 19:49:38,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 6.0) internal successors, (90), 18 states have internal predecessors, (90), 6 states have call successors, (22), 3 states have call predecessors, (22), 9 states have return successors, (22), 7 states have call predecessors, (22), 6 states have call successors, (22) [2021-11-25 19:49:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 672 transitions. [2021-11-25 19:49:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-25 19:49:38,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:38,067 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:49:38,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:49:38,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 19:49:38,286 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:38,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1025192534, now seen corresponding path program 1 times [2021-11-25 19:49:38,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:38,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884534795] [2021-11-25 19:49:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:38,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 19:49:38,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:38,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884534795] [2021-11-25 19:49:38,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884534795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:49:38,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:49:38,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 19:49:38,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978249939] [2021-11-25 19:49:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:49:38,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:49:38,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:38,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:49:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:49:38,453 INFO L87 Difference]: Start difference. First operand 514 states and 672 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-25 19:49:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:39,167 INFO L93 Difference]: Finished difference Result 1220 states and 1673 transitions. [2021-11-25 19:49:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:49:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 71 [2021-11-25 19:49:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:39,174 INFO L225 Difference]: With dead ends: 1220 [2021-11-25 19:49:39,174 INFO L226 Difference]: Without dead ends: 909 [2021-11-25 19:49:39,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:49:39,176 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 601 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:39,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 1992 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:49:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-11-25 19:49:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 641. [2021-11-25 19:49:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 476 states have (on average 1.3277310924369747) internal successors, (632), 481 states have internal predecessors, (632), 103 states have call successors, (103), 61 states have call predecessors, (103), 61 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2021-11-25 19:49:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 838 transitions. [2021-11-25 19:49:39,255 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 838 transitions. Word has length 71 [2021-11-25 19:49:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:39,255 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 838 transitions. [2021-11-25 19:49:39,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-25 19:49:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 838 transitions. [2021-11-25 19:49:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-25 19:49:39,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:39,258 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:49:39,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 19:49:39,258 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -913951703, now seen corresponding path program 1 times [2021-11-25 19:49:39,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:39,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825847389] [2021-11-25 19:49:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:39,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 19:49:39,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:39,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825847389] [2021-11-25 19:49:39,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825847389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:49:39,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:49:39,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:49:39,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662218236] [2021-11-25 19:49:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:49:39,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:49:39,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:49:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:49:39,312 INFO L87 Difference]: Start difference. First operand 641 states and 838 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 19:49:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:39,550 INFO L93 Difference]: Finished difference Result 1605 states and 2140 transitions. [2021-11-25 19:49:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:49:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-11-25 19:49:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:39,559 INFO L225 Difference]: With dead ends: 1605 [2021-11-25 19:49:39,559 INFO L226 Difference]: Without dead ends: 1162 [2021-11-25 19:49:39,560 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-25 19:49:39,561 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 342 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:39,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 813 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:49:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2021-11-25 19:49:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1041. [2021-11-25 19:49:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 772 states have (on average 1.3186528497409327) internal successors, (1018), 781 states have internal predecessors, (1018), 168 states have call successors, (168), 100 states have call predecessors, (168), 100 states have return successors, (168), 159 states have call predecessors, (168), 168 states have call successors, (168) [2021-11-25 19:49:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1354 transitions. [2021-11-25 19:49:39,678 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1354 transitions. Word has length 71 [2021-11-25 19:49:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:39,679 INFO L470 AbstractCegarLoop]: Abstraction has 1041 states and 1354 transitions. [2021-11-25 19:49:39,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 19:49:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1354 transitions. [2021-11-25 19:49:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-25 19:49:39,681 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:39,681 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:49:39,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 19:49:39,681 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1420846434, now seen corresponding path program 1 times [2021-11-25 19:49:39,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:39,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629837773] [2021-11-25 19:49:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:39,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:49:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 19:49:39,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:49:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629837773] [2021-11-25 19:49:39,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629837773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:49:39,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:49:39,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 19:49:39,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335547857] [2021-11-25 19:49:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:49:39,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:49:39,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:49:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:49:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:49:39,809 INFO L87 Difference]: Start difference. First operand 1041 states and 1354 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-25 19:49:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:49:40,653 INFO L93 Difference]: Finished difference Result 2948 states and 3996 transitions. [2021-11-25 19:49:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 19:49:40,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2021-11-25 19:49:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:49:40,667 INFO L225 Difference]: With dead ends: 2948 [2021-11-25 19:49:40,667 INFO L226 Difference]: Without dead ends: 2161 [2021-11-25 19:49:40,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-25 19:49:40,670 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 776 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:49:40,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1842 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:49:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2021-11-25 19:49:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 1456. [2021-11-25 19:49:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1071 states have (on average 1.3090569561157797) internal successors, (1402), 1083 states have internal predecessors, (1402), 244 states have call successors, (244), 140 states have call predecessors, (244), 140 states have return successors, (244), 232 states have call predecessors, (244), 244 states have call successors, (244) [2021-11-25 19:49:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1890 transitions. [2021-11-25 19:49:40,881 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1890 transitions. Word has length 73 [2021-11-25 19:49:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:49:40,881 INFO L470 AbstractCegarLoop]: Abstraction has 1456 states and 1890 transitions. [2021-11-25 19:49:40,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-11-25 19:49:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1890 transitions. [2021-11-25 19:49:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-25 19:49:40,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:49:40,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:49:40,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 19:49:40,884 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:49:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:49:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -741502709, now seen corresponding path program 1 times [2021-11-25 19:49:40,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:49:40,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332223960] [2021-11-25 19:49:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:49:40,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:49:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 19:49:40,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 19:49:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 19:49:41,075 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 19:49:41,076 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 19:49:41,077 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 19:49:41,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 19:49:41,082 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] [2021-11-25 19:49:41,086 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 19:49:41,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 07:49:41 BoogieIcfgContainer [2021-11-25 19:49:41,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 19:49:41,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 19:49:41,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 19:49:41,269 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 19:49:41,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:48:04" (3/4) ... [2021-11-25 19:49:41,271 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 19:49:41,438 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 19:49:41,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 19:49:41,439 INFO L158 Benchmark]: Toolchain (without parser) took 98494.44ms. Allocated memory was 111.1MB in the beginning and 715.1MB in the end (delta: 604.0MB). Free memory was 72.5MB in the beginning and 585.5MB in the end (delta: -513.0MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,439 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 111.1MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:49:41,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.38ms. Allocated memory is still 111.1MB. Free memory was 72.3MB in the beginning and 78.9MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.81ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 75.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,440 INFO L158 Benchmark]: Boogie Preprocessor took 54.59ms. Allocated memory is still 111.1MB. Free memory was 75.6MB in the beginning and 73.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,445 INFO L158 Benchmark]: RCFGBuilder took 1147.88ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 62.8MB in the end (delta: 10.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,446 INFO L158 Benchmark]: TraceAbstraction took 96578.27ms. Allocated memory was 111.1MB in the beginning and 715.1MB in the end (delta: 604.0MB). Free memory was 62.2MB in the beginning and 607.5MB in the end (delta: -545.3MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,448 INFO L158 Benchmark]: Witness Printer took 170.49ms. Allocated memory is still 715.1MB. Free memory was 607.5MB in the beginning and 585.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-25 19:49:41,452 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.21ms. Allocated memory is still 111.1MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.38ms. Allocated memory is still 111.1MB. Free memory was 72.3MB in the beginning and 78.9MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.81ms. Allocated memory is still 111.1MB. Free memory was 78.9MB in the beginning and 75.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.59ms. Allocated memory is still 111.1MB. Free memory was 75.6MB in the beginning and 73.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1147.88ms. Allocated memory is still 111.1MB. Free memory was 73.0MB in the beginning and 62.8MB in the end (delta: 10.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 96578.27ms. Allocated memory was 111.1MB in the beginning and 715.1MB in the end (delta: 604.0MB). Free memory was 62.2MB in the beginning and 607.5MB in the end (delta: -545.3MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 170.49ms. Allocated memory is still 715.1MB. Free memory was 607.5MB in the beginning and 585.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.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: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, 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] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, 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] [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 i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [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 [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, 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] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, 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] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, 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 [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, 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 )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, 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 [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 [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 [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, 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 [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, 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=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=-256, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.3s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4463 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4370 mSDsluCounter, 23929 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19917 mSDsCounter, 706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5360 IncrementalHoareTripleChecker+Invalid, 6066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 706 mSolverCounterUnsat, 4869 mSDtfsCounter, 5360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 539 SyntacticMatches, 27 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3148 ImplicationChecksByTransitivity, 41.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1456occurred in iteration=18, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1993 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1306 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 4597 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1602 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 157/169 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: OVERALL_TIME: 4.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 34, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 33, TOOLS_POST_TIME: 1.4s, TOOLS_POST_CALL_APPLICATIONS: 12, TOOLS_POST_CALL_TIME: 1.1s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 53, TOOLS_QUANTIFIERELIM_TIME: 3.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 87, FLUID_YES_ANSWERS: 2, DOMAIN_JOIN_APPLICATIONS: 11, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 2, DOMAIN_ALPHA_TIME: 0.1s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 34, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 996, DAG_COMPRESSION_RETAINED_NODES: 116, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-25 19:49:41,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_790dba4f-c831-4c3f-85a9-35edab100943/bin/utaipan-eEHZpOm5b7/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