./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b1be4311b85b6fe57410228c7ae2544fffadecc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:10:26,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:10:26,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:10:26,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:10:26,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:10:26,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:10:26,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:10:26,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:10:26,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:10:26,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:10:26,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:10:26,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:10:26,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:10:26,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:10:26,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:10:26,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:10:26,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:10:26,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:10:26,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:10:26,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:10:26,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:10:26,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:10:26,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:10:26,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:10:26,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:10:26,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:10:26,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:10:26,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:10:26,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:10:26,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:10:26,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:10:26,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:10:26,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:10:26,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:10:26,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:10:26,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:10:26,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:10:26,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:10:26,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:10:26,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:10:26,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:10:26,570 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:10:26,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:10:26,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:10:26,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:10:26,581 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:10:26,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:10:26,581 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:10:26,581 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:10:26,581 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:10:26,582 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:10:26,582 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:10:26,582 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:10:26,582 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:10:26,582 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:10:26,582 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:10:26,582 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:10:26,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:10:26,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:10:26,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:10:26,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:10:26,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:10:26,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:10:26,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:10:26,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:10:26,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:10:26,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:10:26,585 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan 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(__VERIFIER_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 -> 2b1be4311b85b6fe57410228c7ae2544fffadecc [2019-12-07 14:10:26,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:10:26,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:10:26,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:10:26,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:10:26,698 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:10:26,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-12-07 14:10:26,742 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/data/b6b8bea51/0dbc7cd7f6a54f61a6db1c190668cb55/FLAG32812c8a0 [2019-12-07 14:10:27,241 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:10:27,242 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-12-07 14:10:27,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/data/b6b8bea51/0dbc7cd7f6a54f61a6db1c190668cb55/FLAG32812c8a0 [2019-12-07 14:10:27,258 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/data/b6b8bea51/0dbc7cd7f6a54f61a6db1c190668cb55 [2019-12-07 14:10:27,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:10:27,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:10:27,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:10:27,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:10:27,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:10:27,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b211215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27, skipping insertion in model container [2019-12-07 14:10:27,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:10:27,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:10:27,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:10:27,495 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:10:27,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:10:27,548 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:10:27,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27 WrapperNode [2019-12-07 14:10:27,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:10:27,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:10:27,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:10:27,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:10:27,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:10:27,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:10:27,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:10:27,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:10:27,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... [2019-12-07 14:10:27,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:10:27,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:10:27,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:10:27,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:10:27,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:10:27,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:10:27,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:10:28,616 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:10:28,617 INFO L287 CfgBuilder]: Removed 119 assume(true) statements. [2019-12-07 14:10:28,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:10:28 BoogieIcfgContainer [2019-12-07 14:10:28,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:10:28,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:10:28,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:10:28,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:10:28,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:10:27" (1/3) ... [2019-12-07 14:10:28,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4234c765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:10:28, skipping insertion in model container [2019-12-07 14:10:28,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:10:27" (2/3) ... [2019-12-07 14:10:28,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4234c765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:10:28, skipping insertion in model container [2019-12-07 14:10:28,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:10:28" (3/3) ... [2019-12-07 14:10:28,623 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-12-07 14:10:28,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:10:28,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 14:10:28,642 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 14:10:28,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:10:28,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:10:28,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:10:28,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:10:28,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:10:28,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:10:28,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:10:28,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:10:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2019-12-07 14:10:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:10:28,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:28,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:28,683 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash 584310844, now seen corresponding path program 1 times [2019-12-07 14:10:28,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:28,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479809560] [2019-12-07 14:10:28,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:28,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479809560] [2019-12-07 14:10:28,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:28,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:28,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579745255] [2019-12-07 14:10:28,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:28,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:28,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:28,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:28,904 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 3 states. [2019-12-07 14:10:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:28,984 INFO L93 Difference]: Finished difference Result 465 states and 720 transitions. [2019-12-07 14:10:28,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:28,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 14:10:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:28,997 INFO L225 Difference]: With dead ends: 465 [2019-12-07 14:10:28,997 INFO L226 Difference]: Without dead ends: 232 [2019-12-07 14:10:29,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-07 14:10:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2019-12-07 14:10:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 14:10:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2019-12-07 14:10:29,041 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 11 [2019-12-07 14:10:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,041 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2019-12-07 14:10:29,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2019-12-07 14:10:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:10:29,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 649342094, now seen corresponding path program 1 times [2019-12-07 14:10:29,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581920467] [2019-12-07 14:10:29,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:29,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581920467] [2019-12-07 14:10:29,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:29,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:10:29,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013537089] [2019-12-07 14:10:29,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:29,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:29,113 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand 4 states. [2019-12-07 14:10:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,146 INFO L93 Difference]: Finished difference Result 614 states and 884 transitions. [2019-12-07 14:10:29,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:10:29,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:10:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,150 INFO L225 Difference]: With dead ends: 614 [2019-12-07 14:10:29,150 INFO L226 Difference]: Without dead ends: 405 [2019-12-07 14:10:29,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-12-07 14:10:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 209. [2019-12-07 14:10:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-07 14:10:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions. [2019-12-07 14:10:29,166 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 13 [2019-12-07 14:10:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,166 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 301 transitions. [2019-12-07 14:10:29,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions. [2019-12-07 14:10:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:10:29,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1809607002, now seen corresponding path program 1 times [2019-12-07 14:10:29,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873568684] [2019-12-07 14:10:29,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:29,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873568684] [2019-12-07 14:10:29,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:29,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:29,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277729556] [2019-12-07 14:10:29,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:29,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:29,218 INFO L87 Difference]: Start difference. First operand 209 states and 301 transitions. Second operand 3 states. [2019-12-07 14:10:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,238 INFO L93 Difference]: Finished difference Result 441 states and 636 transitions. [2019-12-07 14:10:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:29,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 14:10:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,240 INFO L225 Difference]: With dead ends: 441 [2019-12-07 14:10:29,240 INFO L226 Difference]: Without dead ends: 233 [2019-12-07 14:10:29,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-07 14:10:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2019-12-07 14:10:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-07 14:10:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 293 transitions. [2019-12-07 14:10:29,264 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 293 transitions. Word has length 15 [2019-12-07 14:10:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,264 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 293 transitions. [2019-12-07 14:10:29,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 293 transitions. [2019-12-07 14:10:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:10:29,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash -694827906, now seen corresponding path program 1 times [2019-12-07 14:10:29,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027744772] [2019-12-07 14:10:29,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:29,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027744772] [2019-12-07 14:10:29,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:29,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:10:29,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876878043] [2019-12-07 14:10:29,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:10:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:29,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:10:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:29,352 INFO L87 Difference]: Start difference. First operand 204 states and 293 transitions. Second operand 5 states. [2019-12-07 14:10:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,438 INFO L93 Difference]: Finished difference Result 545 states and 792 transitions. [2019-12-07 14:10:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:10:29,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 14:10:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,440 INFO L225 Difference]: With dead ends: 545 [2019-12-07 14:10:29,440 INFO L226 Difference]: Without dead ends: 342 [2019-12-07 14:10:29,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:10:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-07 14:10:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 174. [2019-12-07 14:10:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 14:10:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2019-12-07 14:10:29,448 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 19 [2019-12-07 14:10:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,448 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2019-12-07 14:10:29,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:10:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2019-12-07 14:10:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:10:29,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1101592274, now seen corresponding path program 1 times [2019-12-07 14:10:29,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237819558] [2019-12-07 14:10:29,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:29,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237819558] [2019-12-07 14:10:29,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:29,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:10:29,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457938951] [2019-12-07 14:10:29,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:10:29,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:10:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:29,525 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand 5 states. [2019-12-07 14:10:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,611 INFO L93 Difference]: Finished difference Result 579 states and 824 transitions. [2019-12-07 14:10:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:10:29,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 14:10:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,613 INFO L225 Difference]: With dead ends: 579 [2019-12-07 14:10:29,613 INFO L226 Difference]: Without dead ends: 406 [2019-12-07 14:10:29,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:10:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-07 14:10:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 144. [2019-12-07 14:10:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 14:10:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2019-12-07 14:10:29,621 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 24 [2019-12-07 14:10:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,621 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2019-12-07 14:10:29,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:10:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2019-12-07 14:10:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:10:29,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1259097814, now seen corresponding path program 1 times [2019-12-07 14:10:29,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978803766] [2019-12-07 14:10:29,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:29,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978803766] [2019-12-07 14:10:29,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:29,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:10:29,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048220477] [2019-12-07 14:10:29,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:10:29,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:10:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:10:29,716 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand 6 states. [2019-12-07 14:10:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,850 INFO L93 Difference]: Finished difference Result 629 states and 878 transitions. [2019-12-07 14:10:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:10:29,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 14:10:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,852 INFO L225 Difference]: With dead ends: 629 [2019-12-07 14:10:29,852 INFO L226 Difference]: Without dead ends: 486 [2019-12-07 14:10:29,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:10:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-07 14:10:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 198. [2019-12-07 14:10:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 14:10:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2019-12-07 14:10:29,862 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 29 [2019-12-07 14:10:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,863 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2019-12-07 14:10:29,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:10:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2019-12-07 14:10:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 14:10:29,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1180503935, now seen corresponding path program 1 times [2019-12-07 14:10:29,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779724518] [2019-12-07 14:10:29,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779724518] [2019-12-07 14:10:29,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:29,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:29,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373149565] [2019-12-07 14:10:29,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:29,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:29,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:29,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:29,901 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand 3 states. [2019-12-07 14:10:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:29,927 INFO L93 Difference]: Finished difference Result 364 states and 515 transitions. [2019-12-07 14:10:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:29,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 14:10:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:29,929 INFO L225 Difference]: With dead ends: 364 [2019-12-07 14:10:29,929 INFO L226 Difference]: Without dead ends: 221 [2019-12-07 14:10:29,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-07 14:10:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2019-12-07 14:10:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-07 14:10:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 273 transitions. [2019-12-07 14:10:29,937 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 273 transitions. Word has length 30 [2019-12-07 14:10:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:29,937 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 273 transitions. [2019-12-07 14:10:29,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 273 transitions. [2019-12-07 14:10:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:10:29,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:29,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:29,938 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash 383569800, now seen corresponding path program 1 times [2019-12-07 14:10:29,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:29,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018867551] [2019-12-07 14:10:29,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:30,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018867551] [2019-12-07 14:10:30,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:30,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:10:30,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976046488] [2019-12-07 14:10:30,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:10:30,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:10:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:10:30,012 INFO L87 Difference]: Start difference. First operand 194 states and 273 transitions. Second operand 7 states. [2019-12-07 14:10:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:30,257 INFO L93 Difference]: Finished difference Result 876 states and 1210 transitions. [2019-12-07 14:10:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:10:30,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 14:10:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:30,261 INFO L225 Difference]: With dead ends: 876 [2019-12-07 14:10:30,261 INFO L226 Difference]: Without dead ends: 718 [2019-12-07 14:10:30,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:10:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-12-07 14:10:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 236. [2019-12-07 14:10:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:10:30,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 331 transitions. [2019-12-07 14:10:30,284 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 331 transitions. Word has length 33 [2019-12-07 14:10:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:30,284 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 331 transitions. [2019-12-07 14:10:30,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:10:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2019-12-07 14:10:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:10:30,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:30,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:30,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1480642472, now seen corresponding path program 1 times [2019-12-07 14:10:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:30,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669606023] [2019-12-07 14:10:30,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:30,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669606023] [2019-12-07 14:10:30,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:30,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:10:30,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305965707] [2019-12-07 14:10:30,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:30,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:30,322 INFO L87 Difference]: Start difference. First operand 236 states and 331 transitions. Second operand 4 states. [2019-12-07 14:10:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:30,401 INFO L93 Difference]: Finished difference Result 685 states and 949 transitions. [2019-12-07 14:10:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:10:30,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 14:10:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:30,404 INFO L225 Difference]: With dead ends: 685 [2019-12-07 14:10:30,404 INFO L226 Difference]: Without dead ends: 515 [2019-12-07 14:10:30,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-12-07 14:10:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 347. [2019-12-07 14:10:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 14:10:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2019-12-07 14:10:30,423 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 33 [2019-12-07 14:10:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:30,423 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2019-12-07 14:10:30,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2019-12-07 14:10:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:10:30,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:30,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:30,424 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1855919143, now seen corresponding path program 1 times [2019-12-07 14:10:30,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:30,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862292086] [2019-12-07 14:10:30,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:30,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862292086] [2019-12-07 14:10:30,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:30,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:30,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996066516] [2019-12-07 14:10:30,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:30,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:30,455 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand 3 states. [2019-12-07 14:10:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:30,498 INFO L93 Difference]: Finished difference Result 695 states and 958 transitions. [2019-12-07 14:10:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:30,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 14:10:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:30,501 INFO L225 Difference]: With dead ends: 695 [2019-12-07 14:10:30,501 INFO L226 Difference]: Without dead ends: 424 [2019-12-07 14:10:30,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-07 14:10:30,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 341. [2019-12-07 14:10:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-07 14:10:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 465 transitions. [2019-12-07 14:10:30,521 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 465 transitions. Word has length 34 [2019-12-07 14:10:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:30,521 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 465 transitions. [2019-12-07 14:10:30,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 465 transitions. [2019-12-07 14:10:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:10:30,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:30,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:30,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash -536079151, now seen corresponding path program 1 times [2019-12-07 14:10:30,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:30,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818351493] [2019-12-07 14:10:30,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:30,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818351493] [2019-12-07 14:10:30,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:30,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:10:30,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955448622] [2019-12-07 14:10:30,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:10:30,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:10:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:10:30,601 INFO L87 Difference]: Start difference. First operand 341 states and 465 transitions. Second operand 6 states. [2019-12-07 14:10:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:30,798 INFO L93 Difference]: Finished difference Result 1073 states and 1454 transitions. [2019-12-07 14:10:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:10:30,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 14:10:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:30,803 INFO L225 Difference]: With dead ends: 1073 [2019-12-07 14:10:30,803 INFO L226 Difference]: Without dead ends: 847 [2019-12-07 14:10:30,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:10:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-07 14:10:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 345. [2019-12-07 14:10:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 14:10:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 470 transitions. [2019-12-07 14:10:30,834 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 470 transitions. Word has length 34 [2019-12-07 14:10:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:30,834 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 470 transitions. [2019-12-07 14:10:30,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:10:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 470 transitions. [2019-12-07 14:10:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:10:30,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:30,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:30,835 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1578226072, now seen corresponding path program 1 times [2019-12-07 14:10:30,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:30,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326840085] [2019-12-07 14:10:30,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:30,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326840085] [2019-12-07 14:10:30,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:30,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:10:30,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557218444] [2019-12-07 14:10:30,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:10:30,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:30,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:10:30,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:30,891 INFO L87 Difference]: Start difference. First operand 345 states and 470 transitions. Second operand 5 states. [2019-12-07 14:10:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:31,015 INFO L93 Difference]: Finished difference Result 661 states and 914 transitions. [2019-12-07 14:10:31,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:10:31,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 14:10:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:31,018 INFO L225 Difference]: With dead ends: 661 [2019-12-07 14:10:31,018 INFO L226 Difference]: Without dead ends: 659 [2019-12-07 14:10:31,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:10:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-12-07 14:10:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 347. [2019-12-07 14:10:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 14:10:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 472 transitions. [2019-12-07 14:10:31,039 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 472 transitions. Word has length 34 [2019-12-07 14:10:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:31,040 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 472 transitions. [2019-12-07 14:10:31,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:10:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 472 transitions. [2019-12-07 14:10:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:10:31,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:31,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:31,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash -352565956, now seen corresponding path program 1 times [2019-12-07 14:10:31,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:31,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069824554] [2019-12-07 14:10:31,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:31,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069824554] [2019-12-07 14:10:31,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:31,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:10:31,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463837095] [2019-12-07 14:10:31,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:10:31,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:10:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:10:31,081 INFO L87 Difference]: Start difference. First operand 347 states and 472 transitions. Second operand 6 states. [2019-12-07 14:10:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:31,173 INFO L93 Difference]: Finished difference Result 733 states and 1009 transitions. [2019-12-07 14:10:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:10:31,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 14:10:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:31,176 INFO L225 Difference]: With dead ends: 733 [2019-12-07 14:10:31,177 INFO L226 Difference]: Without dead ends: 505 [2019-12-07 14:10:31,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:10:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-12-07 14:10:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 353. [2019-12-07 14:10:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 14:10:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 478 transitions. [2019-12-07 14:10:31,206 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 478 transitions. Word has length 35 [2019-12-07 14:10:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:31,206 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 478 transitions. [2019-12-07 14:10:31,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:10:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 478 transitions. [2019-12-07 14:10:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 14:10:31,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:31,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:31,208 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 563276109, now seen corresponding path program 1 times [2019-12-07 14:10:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814915971] [2019-12-07 14:10:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814915971] [2019-12-07 14:10:31,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:31,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:10:31,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110779028] [2019-12-07 14:10:31,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:10:31,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:10:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:10:31,289 INFO L87 Difference]: Start difference. First operand 353 states and 478 transitions. Second operand 7 states. [2019-12-07 14:10:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:31,637 INFO L93 Difference]: Finished difference Result 1597 states and 2116 transitions. [2019-12-07 14:10:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:10:31,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 14:10:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:31,643 INFO L225 Difference]: With dead ends: 1597 [2019-12-07 14:10:31,643 INFO L226 Difference]: Without dead ends: 1340 [2019-12-07 14:10:31,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:10:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-07 14:10:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 435. [2019-12-07 14:10:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-07 14:10:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 580 transitions. [2019-12-07 14:10:31,673 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 580 transitions. Word has length 35 [2019-12-07 14:10:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:31,673 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 580 transitions. [2019-12-07 14:10:31,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:10:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 580 transitions. [2019-12-07 14:10:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 14:10:31,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:31,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:31,674 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash -5365456, now seen corresponding path program 1 times [2019-12-07 14:10:31,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:31,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708438519] [2019-12-07 14:10:31,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:31,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708438519] [2019-12-07 14:10:31,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:31,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:31,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158305213] [2019-12-07 14:10:31,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:10:31,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:31,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:10:31,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:31,704 INFO L87 Difference]: Start difference. First operand 435 states and 580 transitions. Second operand 3 states. [2019-12-07 14:10:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:31,767 INFO L93 Difference]: Finished difference Result 912 states and 1208 transitions. [2019-12-07 14:10:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:10:31,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 14:10:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:31,771 INFO L225 Difference]: With dead ends: 912 [2019-12-07 14:10:31,771 INFO L226 Difference]: Without dead ends: 607 [2019-12-07 14:10:31,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:10:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-07 14:10:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 410. [2019-12-07 14:10:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 14:10:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 541 transitions. [2019-12-07 14:10:31,807 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 541 transitions. Word has length 36 [2019-12-07 14:10:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:31,807 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 541 transitions. [2019-12-07 14:10:31,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:10:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 541 transitions. [2019-12-07 14:10:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:10:31,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:31,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:31,808 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2110440091, now seen corresponding path program 1 times [2019-12-07 14:10:31,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:31,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99590851] [2019-12-07 14:10:31,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:31,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99590851] [2019-12-07 14:10:31,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:31,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:10:31,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734704199] [2019-12-07 14:10:31,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:31,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:31,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:31,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:31,843 INFO L87 Difference]: Start difference. First operand 410 states and 541 transitions. Second operand 4 states. [2019-12-07 14:10:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:31,923 INFO L93 Difference]: Finished difference Result 1139 states and 1487 transitions. [2019-12-07 14:10:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:10:31,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 14:10:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:31,926 INFO L225 Difference]: With dead ends: 1139 [2019-12-07 14:10:31,927 INFO L226 Difference]: Without dead ends: 851 [2019-12-07 14:10:31,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-07 14:10:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 561. [2019-12-07 14:10:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-12-07 14:10:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 730 transitions. [2019-12-07 14:10:31,960 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 730 transitions. Word has length 37 [2019-12-07 14:10:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:31,960 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 730 transitions. [2019-12-07 14:10:31,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 730 transitions. [2019-12-07 14:10:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:10:31,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:31,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:31,961 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1505083797, now seen corresponding path program 1 times [2019-12-07 14:10:31,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:31,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112221658] [2019-12-07 14:10:31,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:31,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112221658] [2019-12-07 14:10:31,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:31,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:31,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459775692] [2019-12-07 14:10:31,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:31,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:31,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:31,981 INFO L87 Difference]: Start difference. First operand 561 states and 730 transitions. Second operand 4 states. [2019-12-07 14:10:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:32,064 INFO L93 Difference]: Finished difference Result 1264 states and 1629 transitions. [2019-12-07 14:10:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:10:32,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 14:10:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:32,068 INFO L225 Difference]: With dead ends: 1264 [2019-12-07 14:10:32,068 INFO L226 Difference]: Without dead ends: 730 [2019-12-07 14:10:32,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-07 14:10:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 494. [2019-12-07 14:10:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-12-07 14:10:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 633 transitions. [2019-12-07 14:10:32,106 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 633 transitions. Word has length 37 [2019-12-07 14:10:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:32,107 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 633 transitions. [2019-12-07 14:10:32,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 633 transitions. [2019-12-07 14:10:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:10:32,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:32,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:10:32,107 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash -212164615, now seen corresponding path program 1 times [2019-12-07 14:10:32,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:32,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734722788] [2019-12-07 14:10:32,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:32,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734722788] [2019-12-07 14:10:32,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:10:32,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:10:32,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535194883] [2019-12-07 14:10:32,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:10:32,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:10:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:10:32,130 INFO L87 Difference]: Start difference. First operand 494 states and 633 transitions. Second operand 4 states. [2019-12-07 14:10:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:32,191 INFO L93 Difference]: Finished difference Result 1154 states and 1476 transitions. [2019-12-07 14:10:32,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:10:32,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 14:10:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:32,193 INFO L225 Difference]: With dead ends: 1154 [2019-12-07 14:10:32,193 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 14:10:32,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:10:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 14:10:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 458. [2019-12-07 14:10:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 14:10:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 581 transitions. [2019-12-07 14:10:32,243 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 581 transitions. Word has length 40 [2019-12-07 14:10:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:32,243 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 581 transitions. [2019-12-07 14:10:32,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:10:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 581 transitions. [2019-12-07 14:10:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:10:32,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:32,245 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:10:32,245 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -512606550, now seen corresponding path program 1 times [2019-12-07 14:10:32,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:32,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101857157] [2019-12-07 14:10:32,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:32,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101857157] [2019-12-07 14:10:32,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262145761] [2019-12-07 14:10:32,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:32,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:10:32,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:10:32,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:32,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:10:32,496 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:10:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:10:32,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:10:32,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-12-07 14:10:32,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5519169] [2019-12-07 14:10:32,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:10:32,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:10:32,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:10:32,506 INFO L87 Difference]: Start difference. First operand 458 states and 581 transitions. Second operand 6 states. [2019-12-07 14:10:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:32,666 INFO L93 Difference]: Finished difference Result 1283 states and 1655 transitions. [2019-12-07 14:10:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:10:32,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 14:10:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:32,670 INFO L225 Difference]: With dead ends: 1283 [2019-12-07 14:10:32,670 INFO L226 Difference]: Without dead ends: 898 [2019-12-07 14:10:32,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:10:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-12-07 14:10:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 458. [2019-12-07 14:10:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 14:10:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 578 transitions. [2019-12-07 14:10:32,710 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 578 transitions. Word has length 62 [2019-12-07 14:10:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:32,710 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 578 transitions. [2019-12-07 14:10:32,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:10:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 578 transitions. [2019-12-07 14:10:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:10:32,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:32,711 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:10:32,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:32,912 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 531706767, now seen corresponding path program 1 times [2019-12-07 14:10:32,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:32,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133643785] [2019-12-07 14:10:32,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:33,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133643785] [2019-12-07 14:10:33,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378759415] [2019-12-07 14:10:33,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:33,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:10:33,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:10:33,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:10:33,169 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:10:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:10:33,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:10:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-12-07 14:10:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233626275] [2019-12-07 14:10:33,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:10:33,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:10:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:10:33,176 INFO L87 Difference]: Start difference. First operand 458 states and 578 transitions. Second operand 6 states. [2019-12-07 14:10:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:33,403 INFO L93 Difference]: Finished difference Result 1166 states and 1494 transitions. [2019-12-07 14:10:33,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:10:33,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-07 14:10:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:33,407 INFO L225 Difference]: With dead ends: 1166 [2019-12-07 14:10:33,408 INFO L226 Difference]: Without dead ends: 781 [2019-12-07 14:10:33,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:10:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-12-07 14:10:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 458. [2019-12-07 14:10:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 14:10:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2019-12-07 14:10:33,464 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 66 [2019-12-07 14:10:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2019-12-07 14:10:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:10:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2019-12-07 14:10:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:10:33,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:33,466 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:10:33,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:33,667 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1934207957, now seen corresponding path program 1 times [2019-12-07 14:10:33,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:33,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350005317] [2019-12-07 14:10:33,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:33,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350005317] [2019-12-07 14:10:33,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072108158] [2019-12-07 14:10:33,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:33,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:10:33,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:10:33,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:10:33,952 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:10:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:10:33,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:10:33,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-12-07 14:10:33,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243880382] [2019-12-07 14:10:33,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:10:33,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:10:33,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:10:33,964 INFO L87 Difference]: Start difference. First operand 458 states and 575 transitions. Second operand 6 states. [2019-12-07 14:10:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:34,170 INFO L93 Difference]: Finished difference Result 1057 states and 1354 transitions. [2019-12-07 14:10:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:10:34,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 14:10:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:34,173 INFO L225 Difference]: With dead ends: 1057 [2019-12-07 14:10:34,173 INFO L226 Difference]: Without dead ends: 686 [2019-12-07 14:10:34,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:10:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-12-07 14:10:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 458. [2019-12-07 14:10:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-07 14:10:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 574 transitions. [2019-12-07 14:10:34,209 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 574 transitions. Word has length 69 [2019-12-07 14:10:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:34,210 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 574 transitions. [2019-12-07 14:10:34,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:10:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 574 transitions. [2019-12-07 14:10:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:10:34,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:34,211 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:10:34,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:34,411 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1415382522, now seen corresponding path program 1 times [2019-12-07 14:10:34,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:34,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991199946] [2019-12-07 14:10:34,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:34,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991199946] [2019-12-07 14:10:34,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643931159] [2019-12-07 14:10:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:34,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 14:10:34,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:10:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:34,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:34,732 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:10:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:10:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:34,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1456455329] [2019-12-07 14:10:34,933 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2019-12-07 14:10:34,933 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:10:34,939 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:10:34,944 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:10:34,945 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:10:43,174 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:10:43,523 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 101 [2019-12-07 14:10:43,957 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-12-07 14:10:44,300 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 14:10:44,591 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-12-07 14:10:44,891 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2019-12-07 14:10:45,288 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-12-07 14:10:45,641 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-12-07 14:10:46,218 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-12-07 14:10:46,655 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 14:10:47,027 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 14:10:47,350 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-07 14:10:47,598 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 14:10:47,794 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-07 14:10:47,993 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 14:10:48,168 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 14:10:48,547 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 14:10:48,762 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 14:10:49,063 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 14:10:49,258 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 14:10:49,460 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 14:10:49,627 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-12-07 14:10:49,966 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 14:10:50,181 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-07 14:10:50,396 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-12-07 14:10:51,258 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-12-07 14:10:52,237 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2019-12-07 14:10:52,748 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2019-12-07 14:10:53,345 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 14:10:53,913 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 14:10:54,192 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 14:10:54,524 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 14:10:54,905 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-07 14:10:55,299 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 14:10:55,302 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:10:55,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:10:55,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2019-12-07 14:10:55,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244487426] [2019-12-07 14:10:55,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:10:55,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:10:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:10:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2977, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 14:10:55,304 INFO L87 Difference]: Start difference. First operand 458 states and 574 transitions. Second operand 18 states. [2019-12-07 14:10:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:10:56,000 INFO L93 Difference]: Finished difference Result 1531 states and 1968 transitions. [2019-12-07 14:10:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:10:56,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2019-12-07 14:10:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:10:56,005 INFO L225 Difference]: With dead ends: 1531 [2019-12-07 14:10:56,006 INFO L226 Difference]: Without dead ends: 1166 [2019-12-07 14:10:56,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 156 SyntacticMatches, 12 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=377, Invalid=3783, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 14:10:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-12-07 14:10:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 501. [2019-12-07 14:10:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-07 14:10:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 625 transitions. [2019-12-07 14:10:56,064 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 625 transitions. Word has length 73 [2019-12-07 14:10:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:10:56,064 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 625 transitions. [2019-12-07 14:10:56,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:10:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 625 transitions. [2019-12-07 14:10:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:10:56,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:10:56,065 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:10:56,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:56,266 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:10:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:10:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1152405194, now seen corresponding path program 1 times [2019-12-07 14:10:56,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:10:56,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443536163] [2019-12-07 14:10:56,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:10:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:56,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443536163] [2019-12-07 14:10:56,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573192494] [2019-12-07 14:10:56,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:10:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:10:56,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 14:10:56,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:10:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:56,561 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:10:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:10:56,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [839720696] [2019-12-07 14:10:56,755 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2019-12-07 14:10:56,756 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:10:56,756 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:10:56,756 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:10:56,756 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:11:15,070 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:11:18,395 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 219 [2019-12-07 14:11:26,671 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 14:11:35,528 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2019-12-07 14:11:36,874 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-12-07 14:11:36,875 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:11:36,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:11:36,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2019-12-07 14:11:36,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436934126] [2019-12-07 14:11:36,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 14:11:36,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:11:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 14:11:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3327, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 14:11:36,877 INFO L87 Difference]: Start difference. First operand 501 states and 625 transitions. Second operand 18 states. [2019-12-07 14:11:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:11:37,689 INFO L93 Difference]: Finished difference Result 1505 states and 1913 transitions. [2019-12-07 14:11:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:11:37,690 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2019-12-07 14:11:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:11:37,694 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 14:11:37,694 INFO L226 Difference]: Without dead ends: 1136 [2019-12-07 14:11:37,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 155 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=381, Invalid=4175, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 14:11:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-12-07 14:11:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 501. [2019-12-07 14:11:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-07 14:11:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 624 transitions. [2019-12-07 14:11:37,739 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 624 transitions. Word has length 73 [2019-12-07 14:11:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:11:37,739 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 624 transitions. [2019-12-07 14:11:37,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 14:11:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 624 transitions. [2019-12-07 14:11:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:11:37,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:11:37,740 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:11:37,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:11:37,941 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:11:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:11:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash 763516618, now seen corresponding path program 2 times [2019-12-07 14:11:37,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:11:37,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308796992] [2019-12-07 14:11:37,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:11:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:11:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:38,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308796992] [2019-12-07 14:11:38,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362833268] [2019-12-07 14:11:38,078 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:11:38,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 14:11:38,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:11:38,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 14:11:38,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:11:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:38,231 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:11:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:11:38,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [275706420] [2019-12-07 14:11:38,263 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2019-12-07 14:11:38,263 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:11:38,263 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:11:38,263 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:11:38,263 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:11:56,446 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:11:57,962 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 221 [2019-12-07 14:11:59,766 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 229 [2019-12-07 14:12:09,609 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-12-07 14:12:18,221 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2019-12-07 14:12:20,163 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2019-12-07 14:12:20,164 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:12:20,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:12:20,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2019-12-07 14:12:20,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778490825] [2019-12-07 14:12:20,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:12:20,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:12:20,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:12:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2883, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 14:12:20,166 INFO L87 Difference]: Start difference. First operand 501 states and 624 transitions. Second operand 14 states. [2019-12-07 14:12:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:12:26,826 INFO L93 Difference]: Finished difference Result 3070 states and 3923 transitions. [2019-12-07 14:12:26,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 14:12:26,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2019-12-07 14:12:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:12:26,835 INFO L225 Difference]: With dead ends: 3070 [2019-12-07 14:12:26,835 INFO L226 Difference]: Without dead ends: 2705 [2019-12-07 14:12:26,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 159 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=828, Invalid=8678, Unknown=0, NotChecked=0, Total=9506 [2019-12-07 14:12:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2019-12-07 14:12:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 851. [2019-12-07 14:12:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-12-07 14:12:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1081 transitions. [2019-12-07 14:12:26,930 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1081 transitions. Word has length 73 [2019-12-07 14:12:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:12:26,930 INFO L462 AbstractCegarLoop]: Abstraction has 851 states and 1081 transitions. [2019-12-07 14:12:26,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:12:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1081 transitions. [2019-12-07 14:12:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:12:26,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:12:26,932 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:12:27,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:12:27,133 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:12:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:12:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash -723520907, now seen corresponding path program 1 times [2019-12-07 14:12:27,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:12:27,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069769989] [2019-12-07 14:12:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:12:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:12:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:12:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069769989] [2019-12-07 14:12:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091745904] [2019-12-07 14:12:27,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:12:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:12:27,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 14:12:27,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:12:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:12:27,378 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:12:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:12:27,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [804421030] [2019-12-07 14:12:27,500 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2019-12-07 14:12:27,500 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:12:27,500 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:12:27,500 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:12:27,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:12:36,759 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 14:12:37,088 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 101 [2019-12-07 14:12:37,549 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-12-07 14:12:38,547 WARN L192 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 14:12:39,544 WARN L192 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-12-07 14:12:40,748 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2019-12-07 14:12:41,158 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-12-07 14:12:41,515 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-12-07 14:12:41,874 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-12-07 14:12:42,244 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 14:12:42,630 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 14:12:43,371 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-07 14:12:43,784 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-12-07 14:12:44,063 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-07 14:12:44,259 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 14:12:44,440 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-12-07 14:12:45,078 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 14:12:45,471 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 14:12:45,961 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 14:12:46,163 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 14:12:46,366 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 14:12:46,548 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-12-07 14:12:46,872 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-07 14:12:47,091 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-12-07 14:12:47,308 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-12-07 14:12:48,171 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-12-07 14:12:49,082 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2019-12-07 14:12:49,531 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2019-12-07 14:12:50,406 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 14:12:50,837 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-07 14:12:51,129 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 14:12:51,468 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 14:12:51,851 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-07 14:12:52,217 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 14:12:52,218 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 14:12:52,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:12:52,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2019-12-07 14:12:52,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750503731] [2019-12-07 14:12:52,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:12:52,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:12:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:12:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2769, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 14:12:52,219 INFO L87 Difference]: Start difference. First operand 851 states and 1081 transitions. Second operand 14 states. [2019-12-07 14:12:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:12:54,719 INFO L93 Difference]: Finished difference Result 5023 states and 6625 transitions. [2019-12-07 14:12:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 14:12:54,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2019-12-07 14:12:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:12:54,733 INFO L225 Difference]: With dead ends: 5023 [2019-12-07 14:12:54,733 INFO L226 Difference]: Without dead ends: 4351 [2019-12-07 14:12:54,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 164 SyntacticMatches, 11 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3646 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=796, Invalid=8324, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 14:12:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2019-12-07 14:12:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 2312. [2019-12-07 14:12:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-12-07 14:12:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3020 transitions. [2019-12-07 14:12:54,958 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3020 transitions. Word has length 75 [2019-12-07 14:12:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:12:54,958 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3020 transitions. [2019-12-07 14:12:54,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:12:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3020 transitions. [2019-12-07 14:12:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:12:54,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:12:54,960 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 14:12:55,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:12:55,161 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:12:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:12:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -403552507, now seen corresponding path program 1 times [2019-12-07 14:12:55,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:12:55,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473712683] [2019-12-07 14:12:55,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:12:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:12:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:12:55,284 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:12:55,284 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:12:55,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:12:55 BoogieIcfgContainer [2019-12-07 14:12:55,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:12:55,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:12:55,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:12:55,374 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:12:55,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:10:28" (3/4) ... [2019-12-07 14:12:55,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:12:55,462 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_103bf001-6dbd-439d-99a8-24dc4663604c/bin/utaipan/witness.graphml [2019-12-07 14:12:55,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:12:55,463 INFO L168 Benchmark]: Toolchain (without parser) took 148203.06 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,463 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:12:55,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,464 INFO L168 Benchmark]: Boogie Preprocessor took 37.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,464 INFO L168 Benchmark]: RCFGBuilder took 986.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.6 MB in the end (delta: 176.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,464 INFO L168 Benchmark]: TraceAbstraction took 146755.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -208.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,465 INFO L168 Benchmark]: Witness Printer took 88.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:12:55,466 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 986.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.6 MB in the end (delta: 176.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 146755.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -208.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. * Witness Printer took 88.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 654]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L102] static _Bool side1Failed_History_0 ; [L103] static _Bool side1Failed_History_1 ; [L104] static _Bool side1Failed_History_2 ; [L105] static _Bool side2Failed_History_0 ; [L106] static _Bool side2Failed_History_1 ; [L107] static _Bool side2Failed_History_2 ; [L108] static int8_t active_side_History_0 ; [L109] static int8_t active_side_History_1 ; [L110] static int8_t active_side_History_2 ; [L111] static msg_t manual_selection_History_0 ; [L112] static msg_t manual_selection_History_1 ; [L113] static msg_t manual_selection_History_2 ; [L455] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; [L577] int c1 ; [L578] int i2 ; [L581] c1 = 0 [L582] side1Failed = __VERIFIER_nondet_bool() [L583] side2Failed = __VERIFIER_nondet_bool() [L584] side1_written = __VERIFIER_nondet_char() [L585] side2_written = __VERIFIER_nondet_char() [L586] side1Failed_History_0 = __VERIFIER_nondet_bool() [L587] side1Failed_History_1 = __VERIFIER_nondet_bool() [L588] side1Failed_History_2 = __VERIFIER_nondet_bool() [L589] side2Failed_History_0 = __VERIFIER_nondet_bool() [L590] side2Failed_History_1 = __VERIFIER_nondet_bool() [L591] side2Failed_History_2 = __VERIFIER_nondet_bool() [L592] active_side_History_0 = __VERIFIER_nondet_char() [L593] active_side_History_1 = __VERIFIER_nondet_char() [L594] active_side_History_2 = __VERIFIER_nondet_char() [L595] manual_selection_History_0 = __VERIFIER_nondet_char() [L596] manual_selection_History_1 = __VERIFIER_nondet_char() [L597] manual_selection_History_2 = __VERIFIER_nondet_char() [L239] COND FALSE !((int )side1Failed_History_0 != 0) [L242] COND FALSE !((int )side2Failed_History_0 != 0) [L245] COND FALSE !((int )active_side_History_0 != -2) [L248] COND FALSE !((int )manual_selection_History_0 != 0) [L251] COND FALSE !((int )side1Failed_History_1 != 0) [L254] COND FALSE !((int )side2Failed_History_1 != 0) [L257] COND FALSE !((int )active_side_History_1 != -2) [L260] COND FALSE !((int )manual_selection_History_1 != 0) [L263] COND FALSE !((int )side1Failed_History_2 != 0) [L266] COND FALSE !((int )side2Failed_History_2 != 0) [L269] COND FALSE !((int )active_side_History_2 != -2) [L272] COND FALSE !((int )manual_selection_History_2 != 0) [L275] return (1); [L598] i2 = init() [L600] cs1_old = nomsg [L601] cs1_new = nomsg [L602] cs2_old = nomsg [L603] cs2_new = nomsg [L604] s1s2_old = nomsg [L605] s1s2_new = nomsg [L606] s1s1_old = nomsg [L607] s1s1_new = nomsg [L608] s2s1_old = nomsg [L609] s2s1_new = nomsg [L610] s2s2_old = nomsg [L611] s2s2_new = nomsg [L612] s1p_old = nomsg [L613] s1p_new = nomsg [L614] s2p_old = nomsg [L615] s2p_new = nomsg [L616] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=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] [L617] COND TRUE i2 < 10 [L293] msg_t manual_selection ; [L294] char tmp ; [L297] tmp = __VERIFIER_nondet_char() [L298] manual_selection = tmp [L209] manual_selection_History_2 = manual_selection_History_1 [L210] manual_selection_History_1 = manual_selection_History_0 [L211] manual_selection_History_0 = val [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L300] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L301] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )0 [L308] int8_t side1 ; [L309] int8_t side2 ; [L310] msg_t manual_selection ; [L311] int8_t next_state ; [L314] side1 = nomsg [L315] side2 = nomsg [L316] manual_selection = (msg_t )0 [L317] side1Failed = __VERIFIER_nondet_bool() [L119] side1Failed_History_2 = side1Failed_History_1 [L120] side1Failed_History_1 = side1Failed_History_0 [L121] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L319] COND TRUE \read(side1Failed) [L320] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L320] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L321] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L321] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L322] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L322] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L323] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L365] int8_t side1 ; [L366] int8_t side2 ; [L367] msg_t manual_selection ; [L368] int8_t next_state ; [L371] side1 = nomsg [L372] side2 = nomsg [L373] manual_selection = (msg_t )0 [L374] side2Failed = __VERIFIER_nondet_bool() [L149] side2Failed_History_2 = side2Failed_History_1 [L150] side2Failed_History_1 = side2Failed_History_0 [L151] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=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] [L376] COND FALSE !(\read(side2Failed)) [L383] side1 = s1s2_old [L384] s1s2_old = nomsg [L385] side2 = s2s2_old [L386] s2s2_old = nomsg [L387] manual_selection = cs2_old [L388] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=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] [L389] COND TRUE (int )side1 == (int )side2 [L390] 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=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=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] [L413] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L413] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L414] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L414] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L415] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L415] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L416] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=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] [L422] int8_t active_side ; [L423] int8_t tmp ; [L424] int8_t side1 ; [L425] int8_t side2 ; [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=1, cs1_old=-1, cs2=0, cs2_new=1, cs2_old=-1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, 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] [L428] tmp = read_active_side_history((unsigned char)0) [L429] active_side = tmp [L430] side1 = nomsg [L431] side2 = nomsg [L432] side1 = s1p_old [L433] s1p_old = nomsg [L434] side2 = s2p_old [L435] s2p_old = nomsg [L436] COND FALSE !((int )side1 == 1) [L439] COND FALSE !((int )side2 == 1) [L442] COND FALSE !((int )side1 == 0) [L449] active_side = (int8_t )0 [L179] active_side_History_2 = active_side_History_1 [L180] active_side_History_1 = active_side_History_0 [L181] active_side_History_0 = val [L623] cs1_old = cs1_new [L624] cs1_new = nomsg [L625] cs2_old = cs2_new [L626] cs2_new = nomsg [L627] s1s2_old = s1s2_new [L628] s1s2_new = nomsg [L629] s1s1_old = s1s1_new [L630] s1s1_new = nomsg [L631] s2s1_old = s2s1_new [L632] s2s1_new = nomsg [L633] s2s2_old = s2s2_new [L634] s2s2_new = nomsg [L635] s1p_old = s1p_new [L636] s1p_new = nomsg [L637] s2p_old = s2p_new [L638] s2p_new = nomsg [L458] int tmp ; [L459] msg_t tmp___0 ; [L460] _Bool tmp___1 ; [L461] _Bool tmp___2 ; [L462] _Bool tmp___3 ; [L463] _Bool tmp___4 ; [L464] int8_t tmp___5 ; [L465] _Bool tmp___6 ; [L466] _Bool tmp___7 ; [L467] _Bool tmp___8 ; [L468] int8_t tmp___9 ; [L469] _Bool tmp___10 ; [L470] _Bool tmp___11 ; [L471] _Bool tmp___12 ; [L472] msg_t tmp___13 ; [L473] _Bool tmp___14 ; [L474] _Bool tmp___15 ; [L475] _Bool tmp___16 ; [L476] _Bool tmp___17 ; [L477] int8_t tmp___18 ; [L478] int8_t tmp___19 ; [L479] int8_t tmp___20 ; [L482] COND FALSE !(! side1Failed) [L485] COND TRUE ! side2Failed [L486] tmp = 1 [L220] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L223] COND TRUE (int )index == 1 [L224] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L491] tmp___0 = read_manual_selection_history((unsigned char)1) [L492] COND TRUE ! tmp___0 [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L493] tmp___1 = read_side1_failed_history((unsigned char)1) [L494] COND TRUE ! tmp___1 [L130] COND TRUE (int )index == 0 [L131] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L495] tmp___2 = read_side1_failed_history((unsigned char)0) [L496] 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=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L521] tmp___7 = read_side1_failed_history((unsigned char)1) [L522] 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=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L130] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L537] tmp___11 = read_side1_failed_history((unsigned char)1) [L538] COND TRUE ! tmp___11 [L160] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L163] COND TRUE (int )index == 1 [L164] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L539] tmp___12 = read_side2_failed_history((unsigned char)1) [L540] 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=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L190] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L193] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L196] COND TRUE (int )index == 2 [L197] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L553] tmp___20 = read_active_side_history((unsigned char)2) [L554] 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=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L572] return (1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L639] c1 = check() [L652] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L641] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=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] [L617] COND TRUE i2 < 10 [L293] msg_t manual_selection ; [L294] char tmp ; [L297] tmp = __VERIFIER_nondet_char() [L298] manual_selection = tmp [L209] manual_selection_History_2 = manual_selection_History_1 [L210] manual_selection_History_1 = manual_selection_History_0 [L211] manual_selection_History_0 = val [L300] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L300] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L301] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L301] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L302] manual_selection = (msg_t )0 [L308] int8_t side1 ; [L309] int8_t side2 ; [L310] msg_t manual_selection ; [L311] int8_t next_state ; [L314] side1 = nomsg [L315] side2 = nomsg [L316] manual_selection = (msg_t )0 [L317] side1Failed = __VERIFIER_nondet_bool() [L119] side1Failed_History_2 = side1Failed_History_1 [L120] side1Failed_History_1 = side1Failed_History_0 [L121] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L319] COND FALSE !(\read(side1Failed)) [L326] side1 = s1s1_old [L327] s1s1_old = nomsg [L328] side2 = s2s1_old [L329] s2s1_old = nomsg [L330] manual_selection = cs1_old [L331] 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L332] 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L336] COND TRUE (int )side2 != (int )nomsg [L337] 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L356] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L356] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L357] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L357] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L358] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L358] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L359] 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L365] int8_t side1 ; [L366] int8_t side2 ; [L367] msg_t manual_selection ; [L368] int8_t next_state ; [L371] side1 = nomsg [L372] side2 = nomsg [L373] manual_selection = (msg_t )0 [L374] side2Failed = __VERIFIER_nondet_bool() [L149] side2Failed_History_2 = side2Failed_History_1 [L150] side2Failed_History_1 = side2Failed_History_0 [L151] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L376] COND TRUE \read(side2Failed) [L377] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L377] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L378] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L378] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L379] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L379] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L380] 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=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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] [L422] int8_t active_side ; [L423] int8_t tmp ; [L424] int8_t side1 ; [L425] int8_t side2 ; [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=1, manual_selection_History_0=-1, manual_selection_History_1=1, 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] [L428] tmp = read_active_side_history((unsigned char)0) [L429] active_side = tmp [L430] side1 = nomsg [L431] side2 = nomsg [L432] side1 = s1p_old [L433] s1p_old = nomsg [L434] side2 = s2p_old [L435] s2p_old = nomsg [L436] COND FALSE !((int )side1 == 1) [L439] COND FALSE !((int )side2 == 1) [L442] COND FALSE !((int )side1 == 0) [L449] active_side = (int8_t )0 [L179] active_side_History_2 = active_side_History_1 [L180] active_side_History_1 = active_side_History_0 [L181] active_side_History_0 = val [L623] cs1_old = cs1_new [L624] cs1_new = nomsg [L625] cs2_old = cs2_new [L626] cs2_new = nomsg [L627] s1s2_old = s1s2_new [L628] s1s2_new = nomsg [L629] s1s1_old = s1s1_new [L630] s1s1_new = nomsg [L631] s2s1_old = s2s1_new [L632] s2s1_new = nomsg [L633] s2s2_old = s2s2_new [L634] s2s2_new = nomsg [L635] s1p_old = s1p_new [L636] s1p_new = nomsg [L637] s2p_old = s2p_new [L638] s2p_new = nomsg [L458] int tmp ; [L459] msg_t tmp___0 ; [L460] _Bool tmp___1 ; [L461] _Bool tmp___2 ; [L462] _Bool tmp___3 ; [L463] _Bool tmp___4 ; [L464] int8_t tmp___5 ; [L465] _Bool tmp___6 ; [L466] _Bool tmp___7 ; [L467] _Bool tmp___8 ; [L468] int8_t tmp___9 ; [L469] _Bool tmp___10 ; [L470] _Bool tmp___11 ; [L471] _Bool tmp___12 ; [L472] msg_t tmp___13 ; [L473] _Bool tmp___14 ; [L474] _Bool tmp___15 ; [L475] _Bool tmp___16 ; [L476] _Bool tmp___17 ; [L477] int8_t tmp___18 ; [L478] int8_t tmp___19 ; [L479] int8_t tmp___20 ; [L482] COND TRUE ! side1Failed [L483] tmp = 1 [L220] COND FALSE !((int )index == 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=1, 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] [L223] COND TRUE (int )index == 1 [L224] return (manual_selection_History_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=1, 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] [L491] tmp___0 = read_manual_selection_history((unsigned char)1) [L492] 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=1, 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] [L130] COND FALSE !((int )index == 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=1, 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] [L133] COND TRUE (int )index == 1 [L134] return (side1Failed_History_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=1, 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] [L521] tmp___7 = read_side1_failed_history((unsigned char)1) [L522] COND TRUE \read(tmp___7) [L160] COND FALSE !((int )index == 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=1, 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] [L163] COND TRUE (int )index == 1 [L164] return (side2Failed_History_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=1, 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] [L523] tmp___8 = read_side2_failed_history((unsigned char)1) [L524] COND TRUE ! tmp___8 [L190] COND TRUE (int )index == 0 [L191] return (active_side_History_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=1, 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] [L525] tmp___5 = read_active_side_history((unsigned char)0) [L526] COND TRUE ! ((int )tmp___5 == 2) [L527] return (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=1, 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] [L639] c1 = check() [L652] COND TRUE ! arg 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=1, 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] [L654] __VERIFIER_error() 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=1, 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 1 procedures, 232 locations, 23 error locations. Result: UNSAFE, OverallTime: 146.6s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8166 SDtfs, 16720 SDslu, 25464 SDs, 0 SdLazy, 4507 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1560 GetRequests, 1062 SyntacticMatches, 52 SemanticMatches, 446 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10511 ImplicationChecksByTransitivity, 81.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2312occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 10740 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1963 ConstructedInterpolants, 0 QuantifiedInterpolants, 489132 SizeOfPredicates, 69 NumberOfNonLiveVariables, 3822 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 323/408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...