./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh --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 ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 08:52:52,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:52:52,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:52:52,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:52:52,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:52:52,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:52:52,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:52:52,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:52:52,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:52:52,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:52:52,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:52:52,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:52:52,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:52:52,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:52:52,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:52:52,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:52:52,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:52:52,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:52:52,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:52:52,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:52:52,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:52:52,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:52:52,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:52:52,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:52:52,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:52:52,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:52:52,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:52:52,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:52:52,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:52:52,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:52:52,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:52:52,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:52:52,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:52:52,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:52:52,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:52:52,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:52:52,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:52:52,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:52:52,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:52:52,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:52:52,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:52:52,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 08:52:52,507 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:52:52,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:52:52,507 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:52:52,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:52:52,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:52:52,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:52:52,509 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:52:52,509 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:52:52,509 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:52:52,509 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:52:52,509 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:52:52,510 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:52:52,510 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:52:52,510 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:52:52,510 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:52:52,511 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:52:52,511 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:52:52,511 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:52:52,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:52:52,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 08:52:52,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:52:52,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 08:52:52,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:52:52,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 08:52:52,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:52:52,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:52:52,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:52:52,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:52:52,513 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:52:52,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/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_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh 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 -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2022-12-14 08:52:52,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:52:52,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:52:52,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:52:52,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:52:52,735 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:52:52,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2022-12-14 08:52:55,267 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:52:55,438 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:52:55,438 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2022-12-14 08:52:55,444 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/data/0c6bbeaf6/b13fb2cf65c244c1a8cb1745db2114b2/FLAGc8653d155 [2022-12-14 08:52:55,454 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/data/0c6bbeaf6/b13fb2cf65c244c1a8cb1745db2114b2 [2022-12-14 08:52:55,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:52:55,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:52:55,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:52:55,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:52:55,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:52:55,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622ad110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55, skipping insertion in model container [2022-12-14 08:52:55,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:52:55,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:52:55,642 WARN L237 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_1cdff113-73dc-474a-a528-45d65d260506/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2022-12-14 08:52:55,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:52:55,653 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:52:55,693 WARN L237 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_1cdff113-73dc-474a-a528-45d65d260506/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2022-12-14 08:52:55,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:52:55,705 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:52:55,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55 WrapperNode [2022-12-14 08:52:55,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:52:55,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:52:55,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:52:55,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:52:55,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,747 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 474 [2022-12-14 08:52:55,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:52:55,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:52:55,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:52:55,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:52:55,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,778 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:52:55,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:52:55,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:52:55,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:52:55,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (1/1) ... [2022-12-14 08:52:55,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:52:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:52:55,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:52:55,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:52:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-12-14 08:52:55,849 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-12-14 08:52:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:52:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-12-14 08:52:55,849 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-12-14 08:52:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-12-14 08:52:55,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-12-14 08:52:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-12-14 08:52:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-12-14 08:52:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 08:52:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 08:52:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:52:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-12-14 08:52:55,850 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-12-14 08:52:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:52:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:52:55,851 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-12-14 08:52:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-12-14 08:52:55,944 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:52:55,946 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:52:56,360 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:52:56,483 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:52:56,484 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 08:52:56,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:52:56 BoogieIcfgContainer [2022-12-14 08:52:56,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:52:56,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:52:56,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:52:56,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:52:56,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:52:55" (1/3) ... [2022-12-14 08:52:56,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d60dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:52:56, skipping insertion in model container [2022-12-14 08:52:56,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:55" (2/3) ... [2022-12-14 08:52:56,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d60dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:52:56, skipping insertion in model container [2022-12-14 08:52:56,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:52:56" (3/3) ... [2022-12-14 08:52:56,492 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2022-12-14 08:52:56,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:52:56,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 08:52:56,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:52:56,561 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@67a55f72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:52:56,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 08:52:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 105 states have internal predecessors, (158), 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) [2022-12-14 08:52:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 08:52:56,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:56,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:56,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1913103552, now seen corresponding path program 1 times [2022-12-14 08:52:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:56,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020499494] [2022-12-14 08:52:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:52:56,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:56,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020499494] [2022-12-14 08:52:56,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020499494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:56,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:56,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145275925] [2022-12-14 08:52:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:56,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:56,892 INFO L87 Difference]: Start difference. First operand has 143 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 105 states have internal predecessors, (158), 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) [2022-12-14 08:52:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:56,986 INFO L93 Difference]: Finished difference Result 286 states and 467 transitions. [2022-12-14 08:52:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:56,988 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 [2022-12-14 08:52:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:56,995 INFO L225 Difference]: With dead ends: 286 [2022-12-14 08:52:56,995 INFO L226 Difference]: Without dead ends: 146 [2022-12-14 08:52:56,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:57,000 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 5 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:57,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 608 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:52:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-14 08:52:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-12-14 08:52:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.5) internal successors, (159), 107 states have internal predecessors, (159), 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) [2022-12-14 08:52:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2022-12-14 08:52:57,039 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 19 [2022-12-14 08:52:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:57,039 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2022-12-14 08:52:57,039 INFO L496 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) [2022-12-14 08:52:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2022-12-14 08:52:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:52:57,041 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:57,041 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:57,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:52:57,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1812117405, now seen corresponding path program 1 times [2022-12-14 08:52:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:57,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465637031] [2022-12-14 08:52:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:52:57,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:57,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465637031] [2022-12-14 08:52:57,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465637031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:57,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:57,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311530135] [2022-12-14 08:52:57,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:57,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:57,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:57,196 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-14 08:52:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:57,249 INFO L93 Difference]: Finished difference Result 294 states and 445 transitions. [2022-12-14 08:52:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:57,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2022-12-14 08:52:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:57,251 INFO L225 Difference]: With dead ends: 294 [2022-12-14 08:52:57,251 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 08:52:57,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:57,252 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 6 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:57,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 620 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:52:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 08:52:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-12-14 08:52:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.481818181818182) internal successors, (163), 111 states have internal predecessors, (163), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 08:52:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2022-12-14 08:52:57,263 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 28 [2022-12-14 08:52:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:57,263 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2022-12-14 08:52:57,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-12-14 08:52:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-12-14 08:52:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 08:52:57,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:57,264 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:57,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:52:57,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1865378024, now seen corresponding path program 1 times [2022-12-14 08:52:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:57,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159296262] [2022-12-14 08:52:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:52:57,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159296262] [2022-12-14 08:52:57,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159296262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:57,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:57,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938982734] [2022-12-14 08:52:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:57,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:57,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:57,392 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) [2022-12-14 08:52:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:57,451 INFO L93 Difference]: Finished difference Result 304 states and 456 transitions. [2022-12-14 08:52:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 36 [2022-12-14 08:52:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:57,452 INFO L225 Difference]: With dead ends: 304 [2022-12-14 08:52:57,452 INFO L226 Difference]: Without dead ends: 156 [2022-12-14 08:52:57,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:57,453 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 6 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:57,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 606 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:52:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-14 08:52:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-12-14 08:52:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 114 states have (on average 1.4649122807017543) internal successors, (167), 115 states have internal predecessors, (167), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 08:52:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 229 transitions. [2022-12-14 08:52:57,463 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 229 transitions. Word has length 36 [2022-12-14 08:52:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:57,463 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 229 transitions. [2022-12-14 08:52:57,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) [2022-12-14 08:52:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 229 transitions. [2022-12-14 08:52:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 08:52:57,464 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:57,464 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:57,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:52:57,465 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:57,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash 338806196, now seen corresponding path program 1 times [2022-12-14 08:52:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:57,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552051635] [2022-12-14 08:52:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:52:57,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:57,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552051635] [2022-12-14 08:52:57,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552051635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:57,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:57,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481448231] [2022-12-14 08:52:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:57,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:57,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:57,587 INFO L87 Difference]: Start difference. First operand 156 states and 229 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-12-14 08:52:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:57,641 INFO L93 Difference]: Finished difference Result 314 states and 464 transitions. [2022-12-14 08:52:57,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:57,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 44 [2022-12-14 08:52:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:57,644 INFO L225 Difference]: With dead ends: 314 [2022-12-14 08:52:57,644 INFO L226 Difference]: Without dead ends: 161 [2022-12-14 08:52:57,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:57,646 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 6 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:57,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 606 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:52:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-14 08:52:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-12-14 08:52:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 08:52:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 233 transitions. [2022-12-14 08:52:57,659 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 233 transitions. Word has length 44 [2022-12-14 08:52:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:57,659 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 233 transitions. [2022-12-14 08:52:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-12-14 08:52:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 233 transitions. [2022-12-14 08:52:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 08:52:57,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:57,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:57,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:52:57,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2057653107, now seen corresponding path program 1 times [2022-12-14 08:52:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:57,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944537029] [2022-12-14 08:52:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:52:57,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:57,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944537029] [2022-12-14 08:52:57,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944537029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:57,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:57,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078401049] [2022-12-14 08:52:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:57,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:57,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:57,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:57,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:57,790 INFO L87 Difference]: Start difference. First operand 161 states and 233 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-12-14 08:52:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:57,839 INFO L93 Difference]: Finished difference Result 323 states and 468 transitions. [2022-12-14 08:52:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 44 [2022-12-14 08:52:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:57,841 INFO L225 Difference]: With dead ends: 323 [2022-12-14 08:52:57,841 INFO L226 Difference]: Without dead ends: 165 [2022-12-14 08:52:57,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:57,843 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 5 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:57,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 615 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:52:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-12-14 08:52:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-12-14 08:52:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.43801652892562) internal successors, (174), 122 states have internal predecessors, (174), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 08:52:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 236 transitions. [2022-12-14 08:52:57,856 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 236 transitions. Word has length 44 [2022-12-14 08:52:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:57,856 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 236 transitions. [2022-12-14 08:52:57,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-12-14 08:52:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 236 transitions. [2022-12-14 08:52:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 08:52:57,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:57,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:57,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:52:57,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash 196151316, now seen corresponding path program 1 times [2022-12-14 08:52:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:57,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518692416] [2022-12-14 08:52:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 08:52:58,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:58,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518692416] [2022-12-14 08:52:58,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518692416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:58,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:58,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557342823] [2022-12-14 08:52:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:58,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:58,036 INFO L87 Difference]: Start difference. First operand 165 states and 236 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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) [2022-12-14 08:52:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:58,084 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2022-12-14 08:52:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 52 [2022-12-14 08:52:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:58,086 INFO L225 Difference]: With dead ends: 333 [2022-12-14 08:52:58,086 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 08:52:58,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:58,087 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:58,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 617 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:52:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 08:52:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-12-14 08:52:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 127 states have internal predecessors, (179), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 08:52:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2022-12-14 08:52:58,105 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 52 [2022-12-14 08:52:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:58,105 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2022-12-14 08:52:58,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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) [2022-12-14 08:52:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2022-12-14 08:52:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 08:52:58,107 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:58,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:58,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:52:58,107 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1444561185, now seen corresponding path program 1 times [2022-12-14 08:52:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:58,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923073174] [2022-12-14 08:52:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:52:58,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923073174] [2022-12-14 08:52:58,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923073174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:52:58,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087800271] [2022-12-14 08:52:58,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:58,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:52:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:52:58,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:52:58,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 08:52:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:58,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 08:52:58,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:52:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:52:58,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:52:58,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087800271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:58,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:52:58,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-12-14 08:52:58,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385080173] [2022-12-14 08:52:58,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:58,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:52:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:58,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:52:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-14 08:52:58,650 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-12-14 08:52:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:58,914 INFO L93 Difference]: Finished difference Result 507 states and 707 transitions. [2022-12-14 08:52:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 08:52:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 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 55 [2022-12-14 08:52:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:58,916 INFO L225 Difference]: With dead ends: 507 [2022-12-14 08:52:58,916 INFO L226 Difference]: Without dead ends: 329 [2022-12-14 08:52:58,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-14 08:52:58,918 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 199 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:58,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1215 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-12-14 08:52:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2022-12-14 08:52:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 239 states have (on average 1.4100418410041842) internal successors, (337), 241 states have internal predecessors, (337), 60 states have call successors, (60), 26 states have call predecessors, (60), 26 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-12-14 08:52:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 457 transitions. [2022-12-14 08:52:58,931 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 457 transitions. Word has length 55 [2022-12-14 08:52:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:58,931 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 457 transitions. [2022-12-14 08:52:58,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 8 states have internal predecessors, (40), 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) [2022-12-14 08:52:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 457 transitions. [2022-12-14 08:52:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 08:52:58,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:58,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:58,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 08:52:59,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 08:52:59,135 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:52:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash -626741754, now seen corresponding path program 1 times [2022-12-14 08:52:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:59,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865373295] [2022-12-14 08:52:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:52:59,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865373295] [2022-12-14 08:52:59,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865373295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:52:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987083196] [2022-12-14 08:52:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:59,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:52:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:52:59,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:52:59,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 08:52:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:59,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 08:52:59,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:52:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:52:59,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:53:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:53:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987083196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:53:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1034371359] [2022-12-14 08:53:00,079 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 08:53:00,079 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:53:00,082 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:53:00,087 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:53:00,088 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:53:01,456 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 08:53:01,478 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:53:01,503 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 94 for LOIs [2022-12-14 08:53:01,540 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:53:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1034371359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:53:10,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:53:10,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [9, 9, 9] total 35 [2022-12-14 08:53:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656486050] [2022-12-14 08:53:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:53:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 08:53:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:53:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 08:53:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 08:53:10,450 INFO L87 Difference]: Start difference. First operand 326 states and 457 transitions. Second operand has 24 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 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) [2022-12-14 08:53:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:53:16,039 INFO L93 Difference]: Finished difference Result 738 states and 1042 transitions. [2022-12-14 08:53:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 08:53:16,040 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 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 57 [2022-12-14 08:53:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:53:16,043 INFO L225 Difference]: With dead ends: 738 [2022-12-14 08:53:16,043 INFO L226 Difference]: Without dead ends: 415 [2022-12-14 08:53:16,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 08:53:16,044 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 121 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:53:16,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 2824 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 08:53:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-12-14 08:53:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 392. [2022-12-14 08:53:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 286 states have (on average 1.3881118881118881) internal successors, (397), 287 states have internal predecessors, (397), 75 states have call successors, (75), 30 states have call predecessors, (75), 30 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2022-12-14 08:53:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 547 transitions. [2022-12-14 08:53:16,080 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 547 transitions. Word has length 57 [2022-12-14 08:53:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:53:16,080 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 547 transitions. [2022-12-14 08:53:16,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 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) [2022-12-14 08:53:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 547 transitions. [2022-12-14 08:53:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 08:53:16,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:53:16,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:53:16,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 08:53:16,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:53:16,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:53:16,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:53:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -329981658, now seen corresponding path program 1 times [2022-12-14 08:53:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:53:16,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136612036] [2022-12-14 08:53:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:16,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:53:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:53:16,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:53:16,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136612036] [2022-12-14 08:53:16,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136612036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:53:16,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190638880] [2022-12-14 08:53:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:53:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:53:16,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:53:16,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 08:53:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:16,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 08:53:16,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:53:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:53:16,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:53:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:53:16,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190638880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:53:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [411130594] [2022-12-14 08:53:16,848 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 08:53:16,848 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:53:16,849 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:53:16,849 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:53:16,849 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:53:18,589 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 08:53:18,610 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:53:18,625 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 08:53:18,667 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:53:29,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [411130594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:53:29,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:53:29,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [9, 9, 9] total 34 [2022-12-14 08:53:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26239242] [2022-12-14 08:53:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:53:29,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 08:53:29,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:53:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 08:53:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 08:53:29,237 INFO L87 Difference]: Start difference. First operand 392 states and 547 transitions. Second operand has 23 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 08:53:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:53:33,426 INFO L93 Difference]: Finished difference Result 811 states and 1149 transitions. [2022-12-14 08:53:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 08:53:33,426 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2022-12-14 08:53:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:53:33,430 INFO L225 Difference]: With dead ends: 811 [2022-12-14 08:53:33,430 INFO L226 Difference]: Without dead ends: 488 [2022-12-14 08:53:33,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 08:53:33,432 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 139 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:53:33,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 3266 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-14 08:53:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-12-14 08:53:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 456. [2022-12-14 08:53:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 332 states have (on average 1.3734939759036144) internal successors, (456), 333 states have internal predecessors, (456), 90 states have call successors, (90), 33 states have call predecessors, (90), 33 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-12-14 08:53:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 636 transitions. [2022-12-14 08:53:33,491 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 636 transitions. Word has length 57 [2022-12-14 08:53:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:53:33,491 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 636 transitions. [2022-12-14 08:53:33,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.9) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 08:53:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 636 transitions. [2022-12-14 08:53:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 08:53:33,492 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:53:33,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:53:33,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 08:53:33,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:53:33,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:53:33,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:53:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash -860397365, now seen corresponding path program 1 times [2022-12-14 08:53:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:53:33,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373191807] [2022-12-14 08:53:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:53:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:53:33,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:53:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373191807] [2022-12-14 08:53:33,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373191807] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:53:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921549229] [2022-12-14 08:53:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:33,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:53:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:53:33,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:53:33,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 08:53:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:34,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 08:53:34,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:53:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:53:34,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:53:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:53:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921549229] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:53:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620881762] [2022-12-14 08:53:34,287 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 08:53:34,287 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:53:34,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:53:34,288 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:53:34,288 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:53:35,368 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 08:53:35,389 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:53:35,405 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2022-12-14 08:53:35,428 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:53:45,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1620881762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:53:45,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:53:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [9, 9, 9] total 37 [2022-12-14 08:53:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954862144] [2022-12-14 08:53:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:53:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 08:53:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:53:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 08:53:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 08:53:45,831 INFO L87 Difference]: Start difference. First operand 456 states and 636 transitions. Second operand has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 18 states have internal predecessors, (40), 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) [2022-12-14 08:53:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:53:53,897 INFO L93 Difference]: Finished difference Result 864 states and 1219 transitions. [2022-12-14 08:53:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 08:53:53,898 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 18 states have internal predecessors, (40), 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 59 [2022-12-14 08:53:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:53:53,900 INFO L225 Difference]: With dead ends: 864 [2022-12-14 08:53:53,900 INFO L226 Difference]: Without dead ends: 541 [2022-12-14 08:53:53,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 08:53:53,901 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 128 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 4185 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:53:53,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 4185 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-12-14 08:53:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-12-14 08:53:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 492. [2022-12-14 08:53:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 358 states have (on average 1.3575418994413408) internal successors, (486), 359 states have internal predecessors, (486), 97 states have call successors, (97), 36 states have call predecessors, (97), 36 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2022-12-14 08:53:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 680 transitions. [2022-12-14 08:53:53,959 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 680 transitions. Word has length 59 [2022-12-14 08:53:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:53:53,959 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 680 transitions. [2022-12-14 08:53:53,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 18 states have internal predecessors, (40), 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) [2022-12-14 08:53:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 680 transitions. [2022-12-14 08:53:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 08:53:53,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:53:53,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:53:53,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 08:53:54,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 08:53:54,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:53:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:53:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1416757144, now seen corresponding path program 1 times [2022-12-14 08:53:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:53:54,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667628381] [2022-12-14 08:53:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:53:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 08:53:54,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:53:54,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667628381] [2022-12-14 08:53:54,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667628381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:53:54,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:53:54,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:53:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500813797] [2022-12-14 08:53:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:53:54,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:53:54,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:53:54,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:53:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:53:54,241 INFO L87 Difference]: Start difference. First operand 492 states and 680 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 08:53:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:53:54,359 INFO L93 Difference]: Finished difference Result 891 states and 1253 transitions. [2022-12-14 08:53:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:53:54,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-12-14 08:53:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:53:54,364 INFO L225 Difference]: With dead ends: 891 [2022-12-14 08:53:54,364 INFO L226 Difference]: Without dead ends: 500 [2022-12-14 08:53:54,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:53:54,366 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 5 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:53:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 615 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:53:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-12-14 08:53:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2022-12-14 08:53:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 364 states have (on average 1.3516483516483517) internal successors, (492), 365 states have internal predecessors, (492), 97 states have call successors, (97), 38 states have call predecessors, (97), 38 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2022-12-14 08:53:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 686 transitions. [2022-12-14 08:53:54,473 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 686 transitions. Word has length 61 [2022-12-14 08:53:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:53:54,473 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 686 transitions. [2022-12-14 08:53:54,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 08:53:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 686 transitions. [2022-12-14 08:53:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 08:53:54,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:53:54,475 INFO L195 NwaCegarLoop]: 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] [2022-12-14 08:53:54,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:53:54,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:53:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:53:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1007800118, now seen corresponding path program 1 times [2022-12-14 08:53:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:53:54,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681164784] [2022-12-14 08:53:54,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:53:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:53:54,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:53:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681164784] [2022-12-14 08:53:54,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681164784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:53:54,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853356313] [2022-12-14 08:53:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:53:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:53:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:53:54,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:53:54,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 08:53:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:53:54,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 08:53:54,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:53:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:53:54,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:53:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:53:55,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853356313] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:53:55,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [824466881] [2022-12-14 08:53:55,060 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 08:53:55,060 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:53:55,061 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:53:55,061 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:53:55,061 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:53:57,720 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 231 for LOIs [2022-12-14 08:53:57,927 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:53:57,950 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 192 for LOIs [2022-12-14 08:53:58,085 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 154 for LOIs [2022-12-14 08:53:58,117 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 151 for LOIs [2022-12-14 08:53:58,160 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 08:53:58,202 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:54:29,506 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13497#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (= ~s1p_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (not (= (mod ~side1Failed~0 256) 0)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (= ~cs1~0 0) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs2_old~0) (= ~s1s1~0 0) (= ~s1s2_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= ~s2s2~0 0) (= ~side2Failed~0 ~side2Failed_History_0~0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= 0 ~manual_selection_History_2~0) (= (mod ~side2Failed_History_1~0 256) 0) (= ~side2_written~0 0) (= ~s1s2~0 0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~s2p_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256)))) (<= (+ 2 ~active_side_History_1~0) 0) (= ~side1Failed_History_0~0 ~side1Failed~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs1_old~0) (= |#NULL.offset| 0) (<= 0 (+ 2 ~active_side_History_2~0)) (= ~s1s1_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (<= ~manual_selection_History_2~0 0) (= ~nomsg~0 ~cs1_new~0) (= ~active_side_History_0~0 0) (<= 0 (+ ~side1_written~0 1)) (= ~nomsg~0 ~s2s2_new~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256))) ~s2s1_old~0) (= ~nomsg~0 ~cs2_new~0) (= ~s2s2_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256) (+ (- 256) (mod (ite (not (= ~nomsg~0 ~side2_written~0)) ~side2_written~0 ~nomsg~0) 256)))) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 0) (= ~nomsg~0 ~s1s2_new~0) (<= 0 |#StackHeapBarrier|) (= ~s2p~0 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 08:54:29,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:54:29,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:54:29,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-12-14 08:54:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499225770] [2022-12-14 08:54:29,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:54:29,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 08:54:29,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:54:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 08:54:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2503, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 08:54:29,508 INFO L87 Difference]: Start difference. First operand 500 states and 686 transitions. Second operand has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-12-14 08:54:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:54:29,953 INFO L93 Difference]: Finished difference Result 1217 states and 1695 transitions. [2022-12-14 08:54:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 08:54:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65 [2022-12-14 08:54:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:54:29,957 INFO L225 Difference]: With dead ends: 1217 [2022-12-14 08:54:29,957 INFO L226 Difference]: Without dead ends: 834 [2022-12-14 08:54:29,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 140 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=277, Invalid=3029, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 08:54:29,958 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 293 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:54:29,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 2229 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:54:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-12-14 08:54:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 528. [2022-12-14 08:54:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 385 states have (on average 1.316883116883117) internal successors, (507), 388 states have internal predecessors, (507), 95 states have call successors, (95), 47 states have call predecessors, (95), 47 states have return successors, (95), 92 states have call predecessors, (95), 95 states have call successors, (95) [2022-12-14 08:54:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 697 transitions. [2022-12-14 08:54:30,081 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 697 transitions. Word has length 65 [2022-12-14 08:54:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:54:30,082 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 697 transitions. [2022-12-14 08:54:30,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-12-14 08:54:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 697 transitions. [2022-12-14 08:54:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 08:54:30,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:54:30,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:54:30,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 08:54:30,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:54:30,284 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:54:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:54:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash -496321369, now seen corresponding path program 1 times [2022-12-14 08:54:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:54:30,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450847909] [2022-12-14 08:54:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:54:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:54:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:54:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:54:30,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:54:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450847909] [2022-12-14 08:54:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450847909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:54:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:54:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 08:54:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188716225] [2022-12-14 08:54:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:54:30,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:54:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:54:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:54:30,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:54:30,504 INFO L87 Difference]: Start difference. First operand 528 states and 697 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-12-14 08:54:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:54:31,012 INFO L93 Difference]: Finished difference Result 1162 states and 1606 transitions. [2022-12-14 08:54:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:54:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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 66 [2022-12-14 08:54:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:54:31,015 INFO L225 Difference]: With dead ends: 1162 [2022-12-14 08:54:31,015 INFO L226 Difference]: Without dead ends: 857 [2022-12-14 08:54:31,016 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:54:31,016 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 523 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:54:31,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1799 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:54:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-12-14 08:54:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 656. [2022-12-14 08:54:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 476 states have (on average 1.3130252100840336) internal successors, (625), 479 states have internal predecessors, (625), 119 states have call successors, (119), 60 states have call predecessors, (119), 60 states have return successors, (119), 116 states have call predecessors, (119), 119 states have call successors, (119) [2022-12-14 08:54:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 863 transitions. [2022-12-14 08:54:31,104 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 863 transitions. Word has length 66 [2022-12-14 08:54:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:54:31,104 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 863 transitions. [2022-12-14 08:54:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-12-14 08:54:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 863 transitions. [2022-12-14 08:54:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 08:54:31,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:54:31,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:54:31,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 08:54:31,106 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:54:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:54:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1933309500, now seen corresponding path program 1 times [2022-12-14 08:54:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:54:31,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271536672] [2022-12-14 08:54:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:54:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:54:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:54:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:54:31,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:54:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271536672] [2022-12-14 08:54:31,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271536672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:54:31,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:54:31,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 08:54:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932256449] [2022-12-14 08:54:31,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:54:31,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:54:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:54:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:54:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:54:31,296 INFO L87 Difference]: Start difference. First operand 656 states and 863 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2022-12-14 08:54:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:54:31,940 INFO L93 Difference]: Finished difference Result 1519 states and 2096 transitions. [2022-12-14 08:54:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:54:31,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 68 [2022-12-14 08:54:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:54:31,944 INFO L225 Difference]: With dead ends: 1519 [2022-12-14 08:54:31,944 INFO L226 Difference]: Without dead ends: 1190 [2022-12-14 08:54:31,945 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:54:31,945 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 699 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:54:31,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1926 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 08:54:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-12-14 08:54:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 917. [2022-12-14 08:54:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 662 states have (on average 1.3217522658610272) internal successors, (875), 667 states have internal predecessors, (875), 169 states have call successors, (169), 85 states have call predecessors, (169), 85 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2022-12-14 08:54:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1213 transitions. [2022-12-14 08:54:32,084 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1213 transitions. Word has length 68 [2022-12-14 08:54:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:54:32,084 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 1213 transitions. [2022-12-14 08:54:32,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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) [2022-12-14 08:54:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1213 transitions. [2022-12-14 08:54:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 08:54:32,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:54:32,086 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:54:32,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:54:32,087 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:54:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:54:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1388908572, now seen corresponding path program 1 times [2022-12-14 08:54:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:54:32,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77347910] [2022-12-14 08:54:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:54:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:54:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:54:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 08:54:32,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:54:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77347910] [2022-12-14 08:54:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77347910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:54:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057058509] [2022-12-14 08:54:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:54:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:54:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:54:32,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:54:32,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 08:54:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:54:32,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:54:32,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:54:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:54:32,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:54:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 08:54:32,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057058509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:54:32,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1106015163] [2022-12-14 08:54:32,661 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-12-14 08:54:32,661 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:54:32,662 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:54:32,662 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:54:32,662 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:54:35,558 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 08:54:35,579 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:54:35,595 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 92 for LOIs [2022-12-14 08:54:35,665 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 08:54:35,710 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:54:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1106015163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:54:55,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:54:55,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [8, 9, 9] total 45 [2022-12-14 08:54:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738001866] [2022-12-14 08:54:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:54:55,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 08:54:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:54:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 08:54:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1801, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 08:54:55,168 INFO L87 Difference]: Start difference. First operand 917 states and 1213 transitions. Second operand has 34 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 08:55:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:55:00,563 INFO L93 Difference]: Finished difference Result 1484 states and 1980 transitions. [2022-12-14 08:55:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 08:55:00,564 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 72 [2022-12-14 08:55:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:55:00,567 INFO L225 Difference]: With dead ends: 1484 [2022-12-14 08:55:00,567 INFO L226 Difference]: Without dead ends: 903 [2022-12-14 08:55:00,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=196, Invalid=1966, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 08:55:00,569 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:55:00,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 2477 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 08:55:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-12-14 08:55:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2022-12-14 08:55:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 652 states have (on average 1.3205521472392638) internal successors, (861), 657 states have internal predecessors, (861), 166 states have call successors, (166), 84 states have call predecessors, (166), 84 states have return successors, (166), 161 states have call predecessors, (166), 166 states have call successors, (166) [2022-12-14 08:55:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1193 transitions. [2022-12-14 08:55:00,676 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1193 transitions. Word has length 72 [2022-12-14 08:55:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:55:00,676 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1193 transitions. [2022-12-14 08:55:00,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 08:55:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1193 transitions. [2022-12-14 08:55:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 08:55:00,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:55:00,677 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:55:00,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 08:55:00,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 08:55:00,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:55:00,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:55:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -326616836, now seen corresponding path program 1 times [2022-12-14 08:55:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:55:00,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102279380] [2022-12-14 08:55:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:55:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 08:55:01,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:55:01,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102279380] [2022-12-14 08:55:01,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102279380] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:55:01,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054786952] [2022-12-14 08:55:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:01,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:55:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:55:01,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:55:01,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 08:55:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:01,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 08:55:01,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:55:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:55:01,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:55:01,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054786952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:55:01,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:55:01,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-12-14 08:55:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456884266] [2022-12-14 08:55:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:55:01,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:55:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:55:01,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:55:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-14 08:55:01,272 INFO L87 Difference]: Start difference. First operand 903 states and 1193 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 08:55:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:55:01,779 INFO L93 Difference]: Finished difference Result 1763 states and 2395 transitions. [2022-12-14 08:55:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:55:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-12-14 08:55:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:55:01,784 INFO L225 Difference]: With dead ends: 1763 [2022-12-14 08:55:01,784 INFO L226 Difference]: Without dead ends: 1065 [2022-12-14 08:55:01,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 08:55:01,787 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 489 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:55:01,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1619 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:55:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2022-12-14 08:55:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 903. [2022-12-14 08:55:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 652 states have (on average 1.3144171779141105) internal successors, (857), 657 states have internal predecessors, (857), 166 states have call successors, (166), 84 states have call predecessors, (166), 84 states have return successors, (166), 161 states have call predecessors, (166), 166 states have call successors, (166) [2022-12-14 08:55:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1189 transitions. [2022-12-14 08:55:01,951 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1189 transitions. Word has length 72 [2022-12-14 08:55:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:55:01,951 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1189 transitions. [2022-12-14 08:55:01,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 08:55:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1189 transitions. [2022-12-14 08:55:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 08:55:01,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:55:01,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:55:01,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 08:55:02,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 08:55:02,153 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:55:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:55:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -175550734, now seen corresponding path program 1 times [2022-12-14 08:55:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:55:02,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379892973] [2022-12-14 08:55:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:55:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 08:55:02,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:55:02,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379892973] [2022-12-14 08:55:02,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379892973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:55:02,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:55:02,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:55:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107328549] [2022-12-14 08:55:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:55:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:55:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:55:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:55:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:55:02,290 INFO L87 Difference]: Start difference. First operand 903 states and 1189 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 08:55:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:55:02,500 INFO L93 Difference]: Finished difference Result 1190 states and 1639 transitions. [2022-12-14 08:55:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:55:02,500 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2022-12-14 08:55:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:55:02,508 INFO L225 Difference]: With dead ends: 1190 [2022-12-14 08:55:02,508 INFO L226 Difference]: Without dead ends: 1188 [2022-12-14 08:55:02,509 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:55:02,510 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 151 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:55:02,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1484 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:55:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2022-12-14 08:55:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 911. [2022-12-14 08:55:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 656 states have (on average 1.3125) internal successors, (861), 663 states have internal predecessors, (861), 168 states have call successors, (168), 86 states have call predecessors, (168), 86 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2022-12-14 08:55:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1197 transitions. [2022-12-14 08:55:02,692 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1197 transitions. Word has length 75 [2022-12-14 08:55:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:55:02,693 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1197 transitions. [2022-12-14 08:55:02,693 INFO L496 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 08:55:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1197 transitions. [2022-12-14 08:55:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 08:55:02,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:55:02,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:55:02,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 08:55:02,695 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:55:02,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:55:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash -970233557, now seen corresponding path program 1 times [2022-12-14 08:55:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:55:02,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723935722] [2022-12-14 08:55:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:55:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 08:55:02,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:55:02,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723935722] [2022-12-14 08:55:02,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723935722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:55:02,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:55:02,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:55:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027653756] [2022-12-14 08:55:02,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:55:02,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:55:02,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:55:02,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:55:02,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:55:02,810 INFO L87 Difference]: Start difference. First operand 911 states and 1197 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 08:55:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:55:02,946 INFO L93 Difference]: Finished difference Result 1575 states and 2081 transitions. [2022-12-14 08:55:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:55:02,947 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 78 [2022-12-14 08:55:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:55:02,952 INFO L225 Difference]: With dead ends: 1575 [2022-12-14 08:55:02,952 INFO L226 Difference]: Without dead ends: 899 [2022-12-14 08:55:02,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:55:02,954 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 7 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:55:02,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 607 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:55:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-12-14 08:55:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-12-14 08:55:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 650 states have (on average 1.2876923076923077) internal successors, (837), 657 states have internal predecessors, (837), 162 states have call successors, (162), 86 states have call predecessors, (162), 86 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-12-14 08:55:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1161 transitions. [2022-12-14 08:55:03,060 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1161 transitions. Word has length 78 [2022-12-14 08:55:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:55:03,060 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1161 transitions. [2022-12-14 08:55:03,060 INFO L496 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 08:55:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1161 transitions. [2022-12-14 08:55:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 08:55:03,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:55:03,061 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:55:03,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 08:55:03,062 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:55:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:55:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash 874377570, now seen corresponding path program 1 times [2022-12-14 08:55:03,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:55:03,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109883379] [2022-12-14 08:55:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:55:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 08:55:03,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:55:03,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109883379] [2022-12-14 08:55:03,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109883379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:55:03,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153849159] [2022-12-14 08:55:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:55:03,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:55:03,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:55:03,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 08:55:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:03,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 08:55:03,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:55:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 08:55:03,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:55:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 08:55:03,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153849159] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:55:03,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80330478] [2022-12-14 08:55:03,636 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-12-14 08:55:03,636 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:55:03,636 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:55:03,636 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:55:03,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:55:06,285 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 217 for LOIs [2022-12-14 08:55:06,450 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:55:06,466 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 121 for LOIs [2022-12-14 08:55:06,548 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 105 for LOIs [2022-12-14 08:55:06,567 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 101 for LOIs [2022-12-14 08:55:06,592 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 94 for LOIs [2022-12-14 08:55:06,615 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:55:33,473 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '35403#(and (<= ~active_side_History_0~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (<= 0 (+ ~s1s1_new~0 1)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (<= 0 (+ ~s2s2_new~0 1)) (= ~cs1~0 0) (<= 0 (+ ~s2s1_new~0 1)) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (<= 0 (+ ~s2p_new~0 1)) (= |assert_#in~arg| 0) (<= 0 ~side2_written~0) (= ~s1s1~0 0) (<= 0 (+ ~s1s2_new~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (= ~s2s2~0 0) (not (= (mod ~side1Failed_History_0~0 256) 0)) (<= 0 (+ ~s1p_new~0 1)) (<= (+ 2 ~active_side_History_2~0) 0) (<= (+ ~s2s1_new~0 1) 0) (<= 0 ~manual_selection_History_2~0) (not (= (mod ~side2Failed_History_1~0 256) 0)) (<= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ 2 ~active_side_History_1~0) 0) (<= (+ ~cs1_new~0 1) 0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= ~manual_selection_History_2~0 0) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (= ~s2p~0 0) (<= (+ ~s2s2_new~0 1) 0) (= (mod ~side1Failed_History_1~0 256) 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 08:55:33,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:55:33,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:55:33,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-12-14 08:55:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611135023] [2022-12-14 08:55:33,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:55:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 08:55:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:55:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 08:55:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3206, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 08:55:33,475 INFO L87 Difference]: Start difference. First operand 899 states and 1161 transitions. Second operand has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-12-14 08:55:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:55:34,020 INFO L93 Difference]: Finished difference Result 1906 states and 2539 transitions. [2022-12-14 08:55:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 08:55:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 80 [2022-12-14 08:55:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:55:34,023 INFO L225 Difference]: With dead ends: 1906 [2022-12-14 08:55:34,023 INFO L226 Difference]: Without dead ends: 1167 [2022-12-14 08:55:34,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 180 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=363, Invalid=3797, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 08:55:34,025 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 234 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:55:34,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 2842 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:55:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-12-14 08:55:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 878. [2022-12-14 08:55:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 635 states have (on average 1.2803149606299213) internal successors, (813), 642 states have internal predecessors, (813), 156 states have call successors, (156), 86 states have call predecessors, (156), 86 states have return successors, (156), 149 states have call predecessors, (156), 156 states have call successors, (156) [2022-12-14 08:55:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1125 transitions. [2022-12-14 08:55:34,128 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1125 transitions. Word has length 80 [2022-12-14 08:55:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:55:34,129 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1125 transitions. [2022-12-14 08:55:34,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.777777777777778) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-12-14 08:55:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1125 transitions. [2022-12-14 08:55:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 08:55:34,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:55:34,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:55:34,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 08:55:34,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:55:34,330 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:55:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:55:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1736630612, now seen corresponding path program 1 times [2022-12-14 08:55:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:55:34,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900805141] [2022-12-14 08:55:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:55:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 08:55:34,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:55:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900805141] [2022-12-14 08:55:34,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900805141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:55:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233243606] [2022-12-14 08:55:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:55:34,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:55:34,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:55:34,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:55:34,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 08:55:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:55:34,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:55:34,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:55:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:55:34,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:55:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 08:55:34,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233243606] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:55:34,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542898422] [2022-12-14 08:55:34,782 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-12-14 08:55:34,783 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:55:34,783 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:55:34,783 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:55:34,783 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:55:36,530 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 08:55:36,550 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:55:36,573 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 94 for LOIs [2022-12-14 08:55:36,640 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 100 for LOIs [2022-12-14 08:55:36,664 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 94 for LOIs [2022-12-14 08:55:36,686 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:55:57,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1542898422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:55:57,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:55:57,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [8, 9, 9] total 53 [2022-12-14 08:55:57,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340066768] [2022-12-14 08:55:57,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:55:57,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 08:55:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:55:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 08:55:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2497, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 08:55:57,105 INFO L87 Difference]: Start difference. First operand 878 states and 1125 transitions. Second operand has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 28 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 08:56:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:56:18,484 INFO L93 Difference]: Finished difference Result 1485 states and 1933 transitions. [2022-12-14 08:56:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 08:56:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 28 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 80 [2022-12-14 08:56:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:56:18,487 INFO L225 Difference]: With dead ends: 1485 [2022-12-14 08:56:18,487 INFO L226 Difference]: Without dead ends: 913 [2022-12-14 08:56:18,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 186 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=458, Invalid=3964, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 08:56:18,489 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 147 mSDsluCounter, 5221 mSDsCounter, 0 mSdLazyCounter, 4181 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 4181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-12-14 08:56:18,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 5493 Invalid, 4264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 4181 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-12-14 08:56:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-12-14 08:56:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 881. [2022-12-14 08:56:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 637 states have (on average 1.2794348508634223) internal successors, (815), 644 states have internal predecessors, (815), 157 states have call successors, (157), 86 states have call predecessors, (157), 86 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2022-12-14 08:56:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1129 transitions. [2022-12-14 08:56:18,602 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1129 transitions. Word has length 80 [2022-12-14 08:56:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:56:18,602 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1129 transitions. [2022-12-14 08:56:18,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 28 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 08:56:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1129 transitions. [2022-12-14 08:56:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 08:56:18,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:56:18,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:56:18,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 08:56:18,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:56:18,804 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:56:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:56:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1665346201, now seen corresponding path program 1 times [2022-12-14 08:56:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:56:18,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141195741] [2022-12-14 08:56:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:56:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:56:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:56:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 08:56:19,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:56:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141195741] [2022-12-14 08:56:19,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141195741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:56:19,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:56:19,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 08:56:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936487809] [2022-12-14 08:56:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:56:19,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:56:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:56:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:56:19,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:56:19,078 INFO L87 Difference]: Start difference. First operand 881 states and 1129 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:56:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:56:19,909 INFO L93 Difference]: Finished difference Result 2462 states and 3388 transitions. [2022-12-14 08:56:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 08:56:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2022-12-14 08:56:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:56:19,914 INFO L225 Difference]: With dead ends: 2462 [2022-12-14 08:56:19,914 INFO L226 Difference]: Without dead ends: 1893 [2022-12-14 08:56:19,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:56:19,916 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 448 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:56:19,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2122 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 08:56:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2022-12-14 08:56:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1153. [2022-12-14 08:56:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 833 states have (on average 1.2785114045618247) internal successors, (1065), 843 states have internal predecessors, (1065), 205 states have call successors, (205), 114 states have call predecessors, (205), 114 states have return successors, (205), 195 states have call predecessors, (205), 205 states have call successors, (205) [2022-12-14 08:56:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1475 transitions. [2022-12-14 08:56:20,082 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1475 transitions. Word has length 82 [2022-12-14 08:56:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:56:20,082 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1475 transitions. [2022-12-14 08:56:20,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:56:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1475 transitions. [2022-12-14 08:56:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 08:56:20,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:56:20,083 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:56:20,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 08:56:20,084 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:56:20,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:56:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash 883067941, now seen corresponding path program 1 times [2022-12-14 08:56:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:56:20,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177110645] [2022-12-14 08:56:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:56:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:56:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:56:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 08:56:20,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:56:20,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177110645] [2022-12-14 08:56:20,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177110645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:56:20,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:56:20,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:56:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825624118] [2022-12-14 08:56:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:56:20,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:56:20,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:56:20,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:56:20,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:56:20,187 INFO L87 Difference]: Start difference. First operand 1153 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-14 08:56:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:56:20,370 INFO L93 Difference]: Finished difference Result 1980 states and 2548 transitions. [2022-12-14 08:56:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:56:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 87 [2022-12-14 08:56:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:56:20,373 INFO L225 Difference]: With dead ends: 1980 [2022-12-14 08:56:20,373 INFO L226 Difference]: Without dead ends: 1135 [2022-12-14 08:56:20,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:56:20,375 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 7 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:56:20,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 589 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:56:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-12-14 08:56:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-12-14 08:56:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 824 states have (on average 1.2487864077669903) internal successors, (1029), 834 states have internal predecessors, (1029), 196 states have call successors, (196), 114 states have call predecessors, (196), 114 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2022-12-14 08:56:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1421 transitions. [2022-12-14 08:56:20,534 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1421 transitions. Word has length 87 [2022-12-14 08:56:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:56:20,534 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 1421 transitions. [2022-12-14 08:56:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-14 08:56:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1421 transitions. [2022-12-14 08:56:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 08:56:20,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:56:20,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:56:20,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 08:56:20,535 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:56:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:56:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1018605783, now seen corresponding path program 1 times [2022-12-14 08:56:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:56:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907286054] [2022-12-14 08:56:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:56:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:56:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:56:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 08:56:20,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:56:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907286054] [2022-12-14 08:56:20,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907286054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:56:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342407983] [2022-12-14 08:56:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:56:20,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:56:20,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:56:20,716 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:56:20,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 08:56:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:56:20,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:56:20,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:56:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:56:20,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:56:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 08:56:20,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342407983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:56:20,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278228090] [2022-12-14 08:56:20,960 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-12-14 08:56:20,961 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:56:20,961 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:56:20,961 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:56:20,961 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:56:24,553 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 08:56:24,583 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:56:24,606 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 122 for LOIs [2022-12-14 08:56:24,708 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 192 for LOIs [2022-12-14 08:56:25,050 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 08:56:25,092 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:56:57,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1278228090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:56:57,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:56:57,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [8, 9, 9] total 54 [2022-12-14 08:56:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52937634] [2022-12-14 08:56:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:56:57,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 08:56:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:56:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 08:56:57,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2588, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 08:56:57,637 INFO L87 Difference]: Start difference. First operand 1135 states and 1421 transitions. Second operand has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 29 states have internal predecessors, (48), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 08:57:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:57:03,780 INFO L93 Difference]: Finished difference Result 1791 states and 2263 transitions. [2022-12-14 08:57:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 08:57:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 29 states have internal predecessors, (48), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 87 [2022-12-14 08:57:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:57:03,784 INFO L225 Difference]: With dead ends: 1791 [2022-12-14 08:57:03,784 INFO L226 Difference]: Without dead ends: 1129 [2022-12-14 08:57:03,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 208 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=282, Invalid=2688, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 08:57:03,785 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 123 mSDsluCounter, 3134 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:57:03,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 3377 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-12-14 08:57:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-12-14 08:57:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1125. [2022-12-14 08:57:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 817 states have (on average 1.2460220318237454) internal successors, (1018), 827 states have internal predecessors, (1018), 193 states have call successors, (193), 114 states have call predecessors, (193), 114 states have return successors, (193), 183 states have call predecessors, (193), 193 states have call successors, (193) [2022-12-14 08:57:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1404 transitions. [2022-12-14 08:57:03,960 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1404 transitions. Word has length 87 [2022-12-14 08:57:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:57:03,960 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1404 transitions. [2022-12-14 08:57:03,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 29 states have internal predecessors, (48), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 08:57:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1404 transitions. [2022-12-14 08:57:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 08:57:03,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:57:03,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:57:03,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 08:57:04,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 08:57:04,163 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:57:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:57:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1099735054, now seen corresponding path program 1 times [2022-12-14 08:57:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:57:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109697561] [2022-12-14 08:57:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:57:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:57:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:57:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 08:57:04,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:57:04,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109697561] [2022-12-14 08:57:04,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109697561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:57:04,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617362153] [2022-12-14 08:57:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:57:04,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:57:04,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:57:04,367 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:57:04,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 08:57:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:57:04,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:57:04,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:57:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:57:04,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:57:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 08:57:04,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617362153] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:57:04,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093567307] [2022-12-14 08:57:04,625 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 08:57:04,625 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:57:04,626 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:57:04,626 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:57:04,626 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:57:07,241 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 08:57:07,262 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:57:07,278 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 208 for LOIs [2022-12-14 08:57:07,613 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 213 for LOIs [2022-12-14 08:57:08,021 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 147 for LOIs [2022-12-14 08:57:08,061 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:57:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1093567307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:57:40,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:57:40,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [8, 9, 9] total 54 [2022-12-14 08:57:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285708062] [2022-12-14 08:57:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:57:40,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 08:57:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:57:40,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 08:57:40,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 08:57:40,341 INFO L87 Difference]: Start difference. First operand 1125 states and 1404 transitions. Second operand has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 30 states have internal predecessors, (50), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-12-14 08:57:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:57:49,404 INFO L93 Difference]: Finished difference Result 1794 states and 2267 transitions. [2022-12-14 08:57:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 08:57:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 30 states have internal predecessors, (50), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 89 [2022-12-14 08:57:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:57:49,409 INFO L225 Difference]: With dead ends: 1794 [2022-12-14 08:57:49,409 INFO L226 Difference]: Without dead ends: 1129 [2022-12-14 08:57:49,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 215 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=252, Invalid=2718, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 08:57:49,411 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 219 mSDsluCounter, 5158 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 5464 SdHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:57:49,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 5464 Invalid, 4127 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-12-14 08:57:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-12-14 08:57:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1125. [2022-12-14 08:57:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 817 states have (on average 1.244798041615667) internal successors, (1017), 827 states have internal predecessors, (1017), 193 states have call successors, (193), 114 states have call predecessors, (193), 114 states have return successors, (193), 183 states have call predecessors, (193), 193 states have call successors, (193) [2022-12-14 08:57:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1403 transitions. [2022-12-14 08:57:49,614 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1403 transitions. Word has length 89 [2022-12-14 08:57:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:57:49,614 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1403 transitions. [2022-12-14 08:57:49,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 30 states have internal predecessors, (50), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-12-14 08:57:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1403 transitions. [2022-12-14 08:57:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 08:57:49,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:57:49,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:57:49,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 08:57:49,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 08:57:49,817 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:57:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:57:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1871523675, now seen corresponding path program 1 times [2022-12-14 08:57:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:57:49,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383153486] [2022-12-14 08:57:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:57:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:57:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:57:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 08:57:49,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:57:49,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383153486] [2022-12-14 08:57:49,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383153486] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:57:49,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523969802] [2022-12-14 08:57:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:57:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:57:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:57:49,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:57:49,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 08:57:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:57:50,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:57:50,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:57:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:57:50,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:57:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 08:57:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523969802] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:57:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1145185107] [2022-12-14 08:57:50,244 INFO L159 IcfgInterpreter]: Started Sifa with 70 locations of interest [2022-12-14 08:57:50,244 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:57:50,245 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:57:50,245 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:57:50,245 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:57:53,427 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 08:57:53,449 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:57:53,465 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 90 for LOIs [2022-12-14 08:57:53,532 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 203 for LOIs [2022-12-14 08:57:53,871 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 147 for LOIs [2022-12-14 08:57:53,912 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:58:27,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1145185107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:58:27,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:58:27,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [8, 9, 9] total 56 [2022-12-14 08:58:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816319010] [2022-12-14 08:58:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:58:27,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 08:58:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:58:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 08:58:27,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2804, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 08:58:27,373 INFO L87 Difference]: Start difference. First operand 1125 states and 1403 transitions. Second operand has 45 states, 40 states have (on average 1.35) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 08:58:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:58:36,740 INFO L93 Difference]: Finished difference Result 1781 states and 2245 transitions. [2022-12-14 08:58:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 08:58:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 1.35) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Word has length 93 [2022-12-14 08:58:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:58:36,744 INFO L225 Difference]: With dead ends: 1781 [2022-12-14 08:58:36,744 INFO L226 Difference]: Without dead ends: 1119 [2022-12-14 08:58:36,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 217 SyntacticMatches, 17 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=293, Invalid=3013, Unknown=0, NotChecked=0, Total=3306 [2022-12-14 08:58:36,746 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 187 mSDsluCounter, 5344 mSDsCounter, 0 mSdLazyCounter, 4385 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 4444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 4385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:58:36,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 5634 Invalid, 4444 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 4385 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-12-14 08:58:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-12-14 08:58:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1115. [2022-12-14 08:58:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 810 states have (on average 1.2419753086419754) internal successors, (1006), 820 states have internal predecessors, (1006), 190 states have call successors, (190), 114 states have call predecessors, (190), 114 states have return successors, (190), 180 states have call predecessors, (190), 190 states have call successors, (190) [2022-12-14 08:58:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1386 transitions. [2022-12-14 08:58:36,923 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1386 transitions. Word has length 93 [2022-12-14 08:58:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:58:36,923 INFO L495 AbstractCegarLoop]: Abstraction has 1115 states and 1386 transitions. [2022-12-14 08:58:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 1.35) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-12-14 08:58:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1386 transitions. [2022-12-14 08:58:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 08:58:36,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:58:36,924 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:58:36,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 08:58:37,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:58:37,126 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:58:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:58:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash -408373035, now seen corresponding path program 1 times [2022-12-14 08:58:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:58:37,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987253870] [2022-12-14 08:58:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:58:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:58:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:58:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-14 08:58:37,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:58:37,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987253870] [2022-12-14 08:58:37,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987253870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:58:37,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:58:37,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:58:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735210028] [2022-12-14 08:58:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:58:37,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:58:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:58:37,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:58:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:58:37,254 INFO L87 Difference]: Start difference. First operand 1115 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-14 08:58:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:58:37,482 INFO L93 Difference]: Finished difference Result 1844 states and 2320 transitions. [2022-12-14 08:58:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:58:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2022-12-14 08:58:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:58:37,485 INFO L225 Difference]: With dead ends: 1844 [2022-12-14 08:58:37,485 INFO L226 Difference]: Without dead ends: 1097 [2022-12-14 08:58:37,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:58:37,486 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:58:37,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 577 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:58:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-12-14 08:58:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 997. [2022-12-14 08:58:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 729 states have (on average 1.1989026063100137) internal successors, (874), 739 states have internal predecessors, (874), 165 states have call successors, (165), 102 states have call predecessors, (165), 102 states have return successors, (165), 155 states have call predecessors, (165), 165 states have call successors, (165) [2022-12-14 08:58:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1204 transitions. [2022-12-14 08:58:37,645 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1204 transitions. Word has length 103 [2022-12-14 08:58:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:58:37,645 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1204 transitions. [2022-12-14 08:58:37,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-14 08:58:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1204 transitions. [2022-12-14 08:58:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 08:58:37,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:58:37,647 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:58:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 08:58:37,647 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:58:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:58:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -671622075, now seen corresponding path program 1 times [2022-12-14 08:58:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:58:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759808519] [2022-12-14 08:58:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:58:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:58:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:58:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 08:58:37,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:58:37,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759808519] [2022-12-14 08:58:37,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759808519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:58:37,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:58:37,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:58:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929339967] [2022-12-14 08:58:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:58:37,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:58:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:58:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:58:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:58:37,764 INFO L87 Difference]: Start difference. First operand 997 states and 1204 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-14 08:58:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:58:37,945 INFO L93 Difference]: Finished difference Result 1560 states and 1919 transitions. [2022-12-14 08:58:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:58:37,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2022-12-14 08:58:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:58:37,948 INFO L225 Difference]: With dead ends: 1560 [2022-12-14 08:58:37,948 INFO L226 Difference]: Without dead ends: 982 [2022-12-14 08:58:37,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:58:37,949 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 6 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:58:37,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 568 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:58:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-12-14 08:58:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 958. [2022-12-14 08:58:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 701 states have (on average 1.1768901569186876) internal successors, (825), 711 states have internal predecessors, (825), 157 states have call successors, (157), 99 states have call predecessors, (157), 99 states have return successors, (157), 147 states have call predecessors, (157), 157 states have call successors, (157) [2022-12-14 08:58:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1139 transitions. [2022-12-14 08:58:38,106 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1139 transitions. Word has length 119 [2022-12-14 08:58:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:58:38,106 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1139 transitions. [2022-12-14 08:58:38,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-12-14 08:58:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1139 transitions. [2022-12-14 08:58:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-14 08:58:38,108 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:58:38,108 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:58:38,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 08:58:38,108 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:58:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:58:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 482117149, now seen corresponding path program 1 times [2022-12-14 08:58:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:58:38,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67179693] [2022-12-14 08:58:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:58:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:58:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:58:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-14 08:58:38,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:58:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67179693] [2022-12-14 08:58:38,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67179693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:58:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998848434] [2022-12-14 08:58:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:58:38,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:58:38,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:58:38,564 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:58:38,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 08:58:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:58:38,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:58:38,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:58:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 08:58:38,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:58:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 08:58:38,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998848434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:58:38,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1939019004] [2022-12-14 08:58:38,917 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-12-14 08:58:38,917 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:58:38,917 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:58:38,917 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:58:38,917 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:58:43,840 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 08:58:43,868 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 08:58:43,884 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 123 for LOIs [2022-12-14 08:58:43,972 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 08:58:44,015 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:59:06,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1939019004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:06,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:59:06,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [9, 9, 9] total 54 [2022-12-14 08:59:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134749890] [2022-12-14 08:59:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:06,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 08:59:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 08:59:06,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2519, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 08:59:06,220 INFO L87 Difference]: Start difference. First operand 958 states and 1139 transitions. Second operand has 36 states, 32 states have (on average 1.71875) internal successors, (55), 24 states have internal predecessors, (55), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 08:59:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:10,399 INFO L93 Difference]: Finished difference Result 1561 states and 1884 transitions. [2022-12-14 08:59:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 08:59:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.71875) internal successors, (55), 24 states have internal predecessors, (55), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) Word has length 128 [2022-12-14 08:59:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:10,403 INFO L225 Difference]: With dead ends: 1561 [2022-12-14 08:59:10,403 INFO L226 Difference]: Without dead ends: 968 [2022-12-14 08:59:10,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 331 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=352, Invalid=2618, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 08:59:10,405 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 50 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:10,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2732 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-14 08:59:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-12-14 08:59:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 958. [2022-12-14 08:59:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 701 states have (on average 1.1754636233951499) internal successors, (824), 711 states have internal predecessors, (824), 157 states have call successors, (157), 99 states have call predecessors, (157), 99 states have return successors, (157), 147 states have call predecessors, (157), 157 states have call successors, (157) [2022-12-14 08:59:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1138 transitions. [2022-12-14 08:59:10,588 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1138 transitions. Word has length 128 [2022-12-14 08:59:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:10,588 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1138 transitions. [2022-12-14 08:59:10,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.71875) internal successors, (55), 24 states have internal predecessors, (55), 8 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 08:59:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1138 transitions. [2022-12-14 08:59:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-14 08:59:10,589 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:10,589 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:10,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 08:59:10,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 08:59:10,790 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:59:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash -851529747, now seen corresponding path program 1 times [2022-12-14 08:59:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:10,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322211614] [2022-12-14 08:59:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:10,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 08:59:11,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322211614] [2022-12-14 08:59:11,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322211614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:59:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745147867] [2022-12-14 08:59:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:59:11,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:59:11,246 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:59:11,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 08:59:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:11,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 08:59:11,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:59:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 64 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 08:59:11,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:59:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 08:59:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745147867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:59:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339025705] [2022-12-14 08:59:12,269 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2022-12-14 08:59:12,270 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:59:12,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:59:12,270 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:59:12,270 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:59:22,848 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 252 for LOIs [2022-12-14 08:59:23,648 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 98 for LOIs [2022-12-14 08:59:23,654 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 96 for LOIs [2022-12-14 08:59:23,723 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 156 for LOIs [2022-12-14 08:59:23,769 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 153 for LOIs [2022-12-14 08:59:23,811 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 95 for LOIs [2022-12-14 08:59:23,833 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:00:00,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1339025705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:00:00,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:00:00,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [9, 9, 9] total 68 [2022-12-14 09:00:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466010056] [2022-12-14 09:00:00,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:00:00,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 09:00:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:00:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 09:00:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=3847, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 09:00:00,401 INFO L87 Difference]: Start difference. First operand 958 states and 1138 transitions. Second operand has 50 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 34 states have internal predecessors, (57), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-14 09:00:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:00:18,392 INFO L93 Difference]: Finished difference Result 1634 states and 1984 transitions. [2022-12-14 09:00:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-14 09:00:18,393 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 34 states have internal predecessors, (57), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 136 [2022-12-14 09:00:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:00:18,397 INFO L225 Difference]: With dead ends: 1634 [2022-12-14 09:00:18,397 INFO L226 Difference]: Without dead ends: 1050 [2022-12-14 09:00:18,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 331 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=986, Invalid=5494, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 09:00:18,400 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 139 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 3464 SdHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:00:18,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 3464 Invalid, 3345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-12-14 09:00:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2022-12-14 09:00:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1028. [2022-12-14 09:00:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 751 states have (on average 1.174434087882823) internal successors, (882), 761 states have internal predecessors, (882), 171 states have call successors, (171), 105 states have call predecessors, (171), 105 states have return successors, (171), 161 states have call predecessors, (171), 171 states have call successors, (171) [2022-12-14 09:00:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1224 transitions. [2022-12-14 09:00:18,639 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1224 transitions. Word has length 136 [2022-12-14 09:00:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:00:18,640 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 1224 transitions. [2022-12-14 09:00:18,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 34 states have internal predecessors, (57), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-14 09:00:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1224 transitions. [2022-12-14 09:00:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-14 09:00:18,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:00:18,643 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:00:18,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 09:00:18,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 09:00:18,844 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:00:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:00:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -554769651, now seen corresponding path program 1 times [2022-12-14 09:00:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:00:18,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193964756] [2022-12-14 09:00:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:18,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:00:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:00:19,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:00:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193964756] [2022-12-14 09:00:19,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193964756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:00:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071769308] [2022-12-14 09:00:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:00:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:00:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:00:19,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:00:19,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 09:00:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:00:19,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 09:00:19,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:00:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 65 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 09:00:19,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:00:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:00:19,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071769308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:00:19,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1466219918] [2022-12-14 09:00:19,908 INFO L159 IcfgInterpreter]: Started Sifa with 74 locations of interest [2022-12-14 09:00:19,909 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:00:19,909 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:00:19,909 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:00:19,909 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:00:50,075 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 80 for LOIs [2022-12-14 09:00:50,129 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 93 for LOIs [2022-12-14 09:00:50,134 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 111 for LOIs [2022-12-14 09:00:50,202 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 93 for LOIs [2022-12-14 09:00:50,276 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 124 for LOIs [2022-12-14 09:00:50,459 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 92 for LOIs [2022-12-14 09:00:50,480 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:01:14,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '81220#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (<= 0 (+ ~s1s1_new~0 1)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (<= 0 (+ ~s2s2_new~0 1)) (= ~cs1~0 0) (<= 0 (+ ~s2s1_new~0 1)) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (<= 0 (+ ~s2p_new~0 1)) (= ~s1s1~0 0) (<= 0 (+ ~s1s2_new~0 1)) (<= 0 ~active_side_History_0~0) (= assert_~arg |assert_#in~arg|) (<= (+ ~cs2_new~0 1) 0) (<= (+ ~s1s2_new~0 1) 0) (= ~s2s2~0 0) (<= 0 (+ ~s1p_new~0 1)) (<= (+ ~s2s1_new~0 1) 0) (= (mod assert_~arg 256) 0) (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~side2_written~0 1)) (= ~s1s2~0 0) (<= 0 (+ ~cs1_new~0 1)) (<= (+ ~cs1_new~0 1) 0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 (+ 2 ~active_side_History_2~0)) (<= 0 (+ ~side1_written~0 1)) (<= ~side2_written~0 0) (<= ~side1_written~0 1) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_453| Int)) (and (= (ite (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_453| 0) 0 1) |assert_#in~arg|) (<= 0 |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_453|) (<= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_453| 1))) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= 0 |#StackHeapBarrier|) (<= (+ ~s2p_new~0 1) 0) (= ~s2p~0 0) (<= (+ ~s2s2_new~0 1) 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 09:01:14,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:01:14,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:01:14,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-14 09:01:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113967246] [2022-12-14 09:01:14,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:01:14,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 09:01:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:01:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 09:01:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=6439, Unknown=0, NotChecked=0, Total=7140 [2022-12-14 09:01:14,859 INFO L87 Difference]: Start difference. First operand 1028 states and 1224 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2022-12-14 09:01:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:01:18,025 INFO L93 Difference]: Finished difference Result 2184 states and 2802 transitions. [2022-12-14 09:01:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 09:01:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 136 [2022-12-14 09:01:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:01:18,029 INFO L225 Difference]: With dead ends: 2184 [2022-12-14 09:01:18,029 INFO L226 Difference]: Without dead ends: 1653 [2022-12-14 09:01:18,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 332 SyntacticMatches, 7 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4189 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=1141, Invalid=10849, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 09:01:18,031 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 1195 mSDsluCounter, 3052 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:01:18,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 3569 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 09:01:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-12-14 09:01:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1158. [2022-12-14 09:01:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 845 states have (on average 1.1668639053254437) internal successors, (986), 855 states have internal predecessors, (986), 191 states have call successors, (191), 121 states have call predecessors, (191), 121 states have return successors, (191), 181 states have call predecessors, (191), 191 states have call successors, (191) [2022-12-14 09:01:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1368 transitions. [2022-12-14 09:01:18,282 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1368 transitions. Word has length 136 [2022-12-14 09:01:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:01:18,282 INFO L495 AbstractCegarLoop]: Abstraction has 1158 states and 1368 transitions. [2022-12-14 09:01:18,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2022-12-14 09:01:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1368 transitions. [2022-12-14 09:01:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-14 09:01:18,284 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:01:18,284 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:01:18,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 09:01:18,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:18,486 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:01:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:01:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash -231496531, now seen corresponding path program 1 times [2022-12-14 09:01:18,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:01:18,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144813883] [2022-12-14 09:01:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:01:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:01:18,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:01:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144813883] [2022-12-14 09:01:18,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144813883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:01:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205511704] [2022-12-14 09:01:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:01:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:01:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:01:18,875 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:01:18,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 09:01:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:01:18,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 09:01:18,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:01:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 26 proven. 47 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 09:01:19,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:01:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 09:01:19,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205511704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:01:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1805792284] [2022-12-14 09:01:19,194 INFO L159 IcfgInterpreter]: Started Sifa with 74 locations of interest [2022-12-14 09:01:19,194 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:01:19,194 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:01:19,194 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:01:19,194 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:01:29,592 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 96 for LOIs [2022-12-14 09:01:29,614 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 98 for LOIs [2022-12-14 09:01:29,621 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 121 for LOIs [2022-12-14 09:01:29,719 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 103 for LOIs [2022-12-14 09:01:29,744 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 95 for LOIs [2022-12-14 09:01:29,767 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:01:55,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1805792284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:01:55,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:01:55,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [9, 8, 8] total 61 [2022-12-14 09:01:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150147255] [2022-12-14 09:01:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:01:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 09:01:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:01:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 09:01:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3313, Unknown=0, NotChecked=0, Total=3660 [2022-12-14 09:01:55,682 INFO L87 Difference]: Start difference. First operand 1158 states and 1368 transitions. Second operand has 46 states, 39 states have (on average 1.564102564102564) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-14 09:02:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:02:15,471 INFO L93 Difference]: Finished difference Result 1947 states and 2320 transitions. [2022-12-14 09:02:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 09:02:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 1.564102564102564) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) Word has length 136 [2022-12-14 09:02:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:02:15,474 INFO L225 Difference]: With dead ends: 1947 [2022-12-14 09:02:15,474 INFO L226 Difference]: Without dead ends: 1170 [2022-12-14 09:02:15,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 350 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=665, Invalid=6141, Unknown=0, NotChecked=0, Total=6806 [2022-12-14 09:02:15,476 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 226 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 3270 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:02:15,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2706 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3270 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 09:02:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-12-14 09:02:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1098. [2022-12-14 09:02:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 801 states have (on average 1.1685393258426966) internal successors, (936), 810 states have internal predecessors, (936), 181 states have call successors, (181), 115 states have call predecessors, (181), 115 states have return successors, (181), 172 states have call predecessors, (181), 181 states have call successors, (181) [2022-12-14 09:02:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1298 transitions. [2022-12-14 09:02:15,706 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1298 transitions. Word has length 136 [2022-12-14 09:02:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:02:15,706 INFO L495 AbstractCegarLoop]: Abstraction has 1098 states and 1298 transitions. [2022-12-14 09:02:15,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 1.564102564102564) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-14 09:02:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1298 transitions. [2022-12-14 09:02:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 09:02:15,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:02:15,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:02:15,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-14 09:02:15,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 09:02:15,909 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:02:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:02:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -623004440, now seen corresponding path program 1 times [2022-12-14 09:02:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:02:15,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650481739] [2022-12-14 09:02:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:15,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:02:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:02:16,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:02:16,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650481739] [2022-12-14 09:02:16,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650481739] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:02:16,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745430795] [2022-12-14 09:02:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:02:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:02:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:02:16,233 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:02:16,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 09:02:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:02:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 09:02:16,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:02:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 09:02:16,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:02:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 09:02:16,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745430795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:02:16,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182814698] [2022-12-14 09:02:16,841 INFO L159 IcfgInterpreter]: Started Sifa with 74 locations of interest [2022-12-14 09:02:16,841 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:02:16,842 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:02:16,842 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:02:16,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:02:31,123 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 254 for LOIs [2022-12-14 09:02:31,952 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 98 for LOIs [2022-12-14 09:02:31,958 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 121 for LOIs [2022-12-14 09:02:32,037 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 156 for LOIs [2022-12-14 09:02:32,080 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 153 for LOIs [2022-12-14 09:02:32,123 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 95 for LOIs [2022-12-14 09:02:32,145 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:03:08,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1182814698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:03:08,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:03:08,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [8, 9, 8] total 69 [2022-12-14 09:03:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025746298] [2022-12-14 09:03:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:03:08,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-14 09:03:08,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:03:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-14 09:03:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=3996, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 09:03:08,599 INFO L87 Difference]: Start difference. First operand 1098 states and 1298 transitions. Second operand has 52 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 36 states have internal predecessors, (60), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-14 09:03:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:03:27,125 INFO L93 Difference]: Finished difference Result 1878 states and 2266 transitions. [2022-12-14 09:03:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-14 09:03:27,126 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 36 states have internal predecessors, (60), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 138 [2022-12-14 09:03:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:03:27,128 INFO L225 Difference]: With dead ends: 1878 [2022-12-14 09:03:27,128 INFO L226 Difference]: Without dead ends: 1220 [2022-12-14 09:03:27,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 342 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2881 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=1037, Invalid=6619, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 09:03:27,130 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 191 mSDsluCounter, 4301 mSDsCounter, 0 mSdLazyCounter, 4268 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 4342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:03:27,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 4524 Invalid, 4342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4268 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-12-14 09:03:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-12-14 09:03:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1100. [2022-12-14 09:03:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 803 states have (on average 1.1693648816936488) internal successors, (939), 812 states have internal predecessors, (939), 181 states have call successors, (181), 115 states have call predecessors, (181), 115 states have return successors, (181), 172 states have call predecessors, (181), 181 states have call successors, (181) [2022-12-14 09:03:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1301 transitions. [2022-12-14 09:03:27,375 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1301 transitions. Word has length 138 [2022-12-14 09:03:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:03:27,375 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1301 transitions. [2022-12-14 09:03:27,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 36 states have internal predecessors, (60), 12 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-12-14 09:03:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1301 transitions. [2022-12-14 09:03:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 09:03:27,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:03:27,376 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:03:27,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 09:03:27,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 09:03:27,578 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:03:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:03:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 170091944, now seen corresponding path program 1 times [2022-12-14 09:03:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:03:27,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488889077] [2022-12-14 09:03:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:03:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:03:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:03:27,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 09:03:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:03:27,714 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 09:03:27,714 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 09:03:27,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 09:03:27,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 09:03:27,719 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:03:27,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:03:27,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:03:27 BoogieIcfgContainer [2022-12-14 09:03:27,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:03:27,816 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:03:27,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:03:27,816 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:03:27,817 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:52:56" (3/4) ... [2022-12-14 09:03:27,818 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 09:03:27,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:03:27,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:03:27,903 INFO L158 Benchmark]: Toolchain (without parser) took 632445.65ms. Allocated memory was 125.8MB in the beginning and 664.8MB in the end (delta: 539.0MB). Free memory was 90.1MB in the beginning and 348.7MB in the end (delta: -258.6MB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.01ms. Allocated memory is still 125.8MB. Free memory was 90.1MB in the beginning and 72.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.70ms. Allocated memory is still 125.8MB. Free memory was 72.7MB in the beginning and 69.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 125.8MB. Free memory was 69.1MB in the beginning and 66.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: RCFGBuilder took 701.64ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 66.4MB in the beginning and 73.5MB in the end (delta: -7.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: TraceAbstraction took 631328.72ms. Allocated memory was 151.0MB in the beginning and 664.8MB in the end (delta: 513.8MB). Free memory was 72.7MB in the beginning and 372.0MB in the end (delta: -299.3MB). Peak memory consumption was 214.2MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,903 INFO L158 Benchmark]: Witness Printer took 86.26ms. Allocated memory is still 664.8MB. Free memory was 372.0MB in the beginning and 348.7MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 09:03:27,904 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.13ms. Allocated memory is still 125.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.01ms. Allocated memory is still 125.8MB. Free memory was 90.1MB in the beginning and 72.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.70ms. Allocated memory is still 125.8MB. Free memory was 72.7MB in the beginning and 69.1MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 125.8MB. Free memory was 69.1MB in the beginning and 66.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 701.64ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 66.4MB in the beginning and 73.5MB in the end (delta: -7.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 631328.72ms. Allocated memory was 151.0MB in the beginning and 664.8MB in the end (delta: 513.8MB). Free memory was 72.7MB in the beginning and 372.0MB in the end (delta: -299.3MB). Peak memory consumption was 214.2MB. Max. memory is 16.1GB. * Witness Printer took 86.26ms. Allocated memory is still 664.8MB. Free memory was 372.0MB in the beginning and 348.7MB in the end (delta: 23.3MB). 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: 610]: 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 ; [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] 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); [L555] RET, EXPR init() [L555] i2 = init() [L556] 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) [L556] 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] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] 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] [L574] COND TRUE 1 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L576] RET Console_task_each_pals_period() [L577] 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 TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] 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 [L394] COND FALSE !((int )side1 == 1) [L397] COND FALSE !((int )side2 == 1) [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; [L439] COND FALSE !(! side1Failed) [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L447] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L608] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, i2=0, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE 1 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L576] RET Console_task_each_pals_period() [L577] 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=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=127, manual_selection=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=127, manual_selection=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=127, manual_selection=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=127, manual_selection=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=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=127, manual_selection=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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 TRUE \read(side2Failed) [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg 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=127, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=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=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=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=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=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=127, index=0, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_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=127, manual_selection_History_0=-1, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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 [L394] COND FALSE !((int )side1 == 1) [L397] COND FALSE !((int )side2 == 1) [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=127, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=127, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=127, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L608] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L610] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 631.2s, OverallIterations: 33, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 138.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6346 SdHoareTripleChecker+Valid, 71.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6069 mSDsluCounter, 71579 SdHoareTripleChecker+Invalid, 64.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62934 mSDsCounter, 2037 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41701 IncrementalHoareTripleChecker+Invalid, 43738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2037 mSolverCounterUnsat, 8645 mSDtfsCounter, 41701 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4775 GetRequests, 3619 SyntacticMatches, 148 SemanticMatches, 1008 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19639 ImplicationChecksByTransitivity, 435.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1158occurred in iteration=30, InterpolantAutomatonStates: 618, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 3242 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 4180 NumberOfCodeBlocks, 4180 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5391 ConstructedInterpolants, 0 QuantifiedInterpolants, 18356 SizeOfPredicates, 131 NumberOfNonLiveVariables, 8500 ConjunctsInSsa, 311 ConjunctsInUnsatCore, 64 InterpolantComputations, 17 PerfectInterpolantSequences, 2383/2580 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: 63.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 66, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 723, DAG_INTERPRETER_EARLY_EXITS: 34, TOOLS_POST_APPLICATIONS: 757, TOOLS_POST_TIME: 18.9s, TOOLS_POST_CALL_APPLICATIONS: 350, TOOLS_POST_CALL_TIME: 20.6s, TOOLS_POST_RETURN_APPLICATIONS: 258, TOOLS_POST_RETURN_TIME: 9.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1365, TOOLS_QUANTIFIERELIM_TIME: 48.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1863, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 370, DOMAIN_JOIN_TIME: 10.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 8, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 723, DOMAIN_ISBOTTOM_TIME: 1.9s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 4.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 8, CALL_SUMMARIZER_APPLICATIONS: 258, CALL_SUMMARIZER_CACHE_MISSES: 54, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 1.0s, DAG_COMPRESSION_PROCESSED_NODES: 91963, DAG_COMPRESSION_RETAINED_NODES: 2503, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 09:03:27,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cdff113-73dc-474a-a528-45d65d260506/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE