./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c -s /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/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 32be2810d9c37c4b52439355c8a9e3577edf70e1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:54:58,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:54:58,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:54:58,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:54:58,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:54:58,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:54:58,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:54:58,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:54:58,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:54:58,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:54:58,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:54:58,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:54:58,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:54:58,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:54:58,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:54:58,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:54:58,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:54:58,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:54:58,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:54:58,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:54:58,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:54:58,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:54:58,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:54:58,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:54:58,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:54:58,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:54:58,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:54:58,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:54:58,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:54:58,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:54:58,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:54:58,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:54:58,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:54:58,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:54:58,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:54:58,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:54:58,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:54:58,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:54:58,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:54:58,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:54:58,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:54:58,588 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:54:58,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:54:58,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:54:58,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:54:58,614 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:54:58,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:54:58,614 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:54:58,614 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:54:58,615 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:54:58,615 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:54:58,615 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:54:58,615 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:54:58,615 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:54:58,615 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:54:58,616 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:54:58,616 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:54:58,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:54:58,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:54:58,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:54:58,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:54:58,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:54:58,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:54:58,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:54:58,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:54:58,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:54:58,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:54:58,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:54:58,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:54:58,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:54:58,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:54:58,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:54:58,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:54:58,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:54:58,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:54:58,629 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:54:58,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:54:58,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:54:58,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:54:58,631 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_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/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 -> 32be2810d9c37c4b52439355c8a9e3577edf70e1 [2019-11-26 02:54:58,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:54:58,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:54:58,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:54:58,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:54:58,779 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:54:58,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2019-11-26 02:54:58,828 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/data/9113c2c71/79352f7e9a1e458b833036a3280f682c/FLAGfaa254409 [2019-11-26 02:54:59,335 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:54:59,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2019-11-26 02:54:59,347 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/data/9113c2c71/79352f7e9a1e458b833036a3280f682c/FLAGfaa254409 [2019-11-26 02:54:59,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/data/9113c2c71/79352f7e9a1e458b833036a3280f682c [2019-11-26 02:54:59,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:54:59,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:54:59,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:54:59,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:54:59,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:54:59,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:59" (1/1) ... [2019-11-26 02:54:59,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397ec9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:54:59, skipping insertion in model container [2019-11-26 02:54:59,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:54:59" (1/1) ... [2019-11-26 02:54:59,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:54:59,924 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:55:00,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:55:00,348 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:55:00,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:55:00,458 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:55:00,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00 WrapperNode [2019-11-26 02:55:00,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:55:00,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:55:00,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:55:00,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:55:00,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:55:00,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:55:00,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:55:00,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:55:00,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... [2019-11-26 02:55:00,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:55:00,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:55:00,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:55:00,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:55:00,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/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-11-26 02:55:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:55:00,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:55:02,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:55:02,343 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:55:02,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:55:02 BoogieIcfgContainer [2019-11-26 02:55:02,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:55:02,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:55:02,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:55:02,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:55:02,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:54:59" (1/3) ... [2019-11-26 02:55:02,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0ea816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:55:02, skipping insertion in model container [2019-11-26 02:55:02,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:55:00" (2/3) ... [2019-11-26 02:55:02,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0ea816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:55:02, skipping insertion in model container [2019-11-26 02:55:02,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:55:02" (3/3) ... [2019-11-26 02:55:02,356 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label23.c [2019-11-26 02:55:02,366 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:55:02,374 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:55:02,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:55:02,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:55:02,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:55:02,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:55:02,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:55:02,414 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:55:02,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:55:02,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:55:02,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:55:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:55:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:55:02,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:02,448 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, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:55:02,449 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:02,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1323243807, now seen corresponding path program 1 times [2019-11-26 02:55:02,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:02,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270494551] [2019-11-26 02:55:02,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:02,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270494551] [2019-11-26 02:55:02,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:02,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:55:02,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44312088] [2019-11-26 02:55:02,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:02,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:02,943 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:55:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:03,594 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:55:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:03,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:55:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:03,615 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:55:03,617 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:55:03,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:55:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:55:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:55:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-26 02:55:03,692 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-26 02:55:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:03,693 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-26 02:55:03,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-26 02:55:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:55:03,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:03,705 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:03,705 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2123301100, now seen corresponding path program 1 times [2019-11-26 02:55:03,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:03,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185845843] [2019-11-26 02:55:03,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:03,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185845843] [2019-11-26 02:55:03,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:03,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:55:03,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517581309] [2019-11-26 02:55:03,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:03,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:03,904 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-11-26 02:55:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:04,478 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-11-26 02:55:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:04,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-26 02:55:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:04,483 INFO L225 Difference]: With dead ends: 786 [2019-11-26 02:55:04,483 INFO L226 Difference]: Without dead ends: 571 [2019-11-26 02:55:04,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-26 02:55:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2019-11-26 02:55:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-26 02:55:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-11-26 02:55:04,509 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-11-26 02:55:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:04,510 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-11-26 02:55:04,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-11-26 02:55:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-26 02:55:04,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:04,513 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:04,513 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1800585521, now seen corresponding path program 1 times [2019-11-26 02:55:04,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:04,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791148734] [2019-11-26 02:55:04,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:04,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791148734] [2019-11-26 02:55:04,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:04,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:55:04,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578547024] [2019-11-26 02:55:04,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:04,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:04,570 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-11-26 02:55:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:05,033 INFO L93 Difference]: Finished difference Result 857 states and 1277 transitions. [2019-11-26 02:55:05,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:55:05,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-26 02:55:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:05,036 INFO L225 Difference]: With dead ends: 857 [2019-11-26 02:55:05,036 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:55:05,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-26 02:55:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:55:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:55:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:55:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-11-26 02:55:05,055 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 92 [2019-11-26 02:55:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:05,055 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-11-26 02:55:05,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-11-26 02:55:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:55:05,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:05,059 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:05,059 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1032089676, now seen corresponding path program 1 times [2019-11-26 02:55:05,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:05,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496614487] [2019-11-26 02:55:05,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:05,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496614487] [2019-11-26 02:55:05,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:05,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:55:05,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862870019] [2019-11-26 02:55:05,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:05,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:05,131 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-11-26 02:55:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:05,484 INFO L93 Difference]: Finished difference Result 1212 states and 1622 transitions. [2019-11-26 02:55:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:05,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-26 02:55:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:05,489 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:55:05,489 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:55:05,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:55:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-26 02:55:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:55:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2019-11-26 02:55:05,528 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 93 [2019-11-26 02:55:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:05,530 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2019-11-26 02:55:05,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2019-11-26 02:55:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:55:05,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:05,535 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:05,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 143195268, now seen corresponding path program 1 times [2019-11-26 02:55:05,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:05,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128633704] [2019-11-26 02:55:05,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:55:05,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128633704] [2019-11-26 02:55:05,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:05,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:55:05,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922418281] [2019-11-26 02:55:05,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:05,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:05,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:05,626 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand 3 states. [2019-11-26 02:55:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:05,952 INFO L93 Difference]: Finished difference Result 1709 states and 2233 transitions. [2019-11-26 02:55:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:05,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:55:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:05,959 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:55:05,959 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:55:05,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:55:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-26 02:55:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:55:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1121 transitions. [2019-11-26 02:55:05,984 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1121 transitions. Word has length 97 [2019-11-26 02:55:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:05,984 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1121 transitions. [2019-11-26 02:55:05,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1121 transitions. [2019-11-26 02:55:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 02:55:05,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:05,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:05,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1126553310, now seen corresponding path program 1 times [2019-11-26 02:55:05,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:05,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036382942] [2019-11-26 02:55:05,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:55:06,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036382942] [2019-11-26 02:55:06,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:06,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:55:06,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660108026] [2019-11-26 02:55:06,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:06,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:06,064 INFO L87 Difference]: Start difference. First operand 855 states and 1121 transitions. Second operand 3 states. [2019-11-26 02:55:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:06,387 INFO L93 Difference]: Finished difference Result 1780 states and 2333 transitions. [2019-11-26 02:55:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:06,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-26 02:55:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:06,393 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:55:06,393 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:55:06,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:55:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 855. [2019-11-26 02:55:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:55:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1121 transitions. [2019-11-26 02:55:06,421 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1121 transitions. Word has length 99 [2019-11-26 02:55:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:06,425 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1121 transitions. [2019-11-26 02:55:06,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1121 transitions. [2019-11-26 02:55:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-26 02:55:06,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:06,428 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:55:06,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash 397469725, now seen corresponding path program 1 times [2019-11-26 02:55:06,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:06,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380834370] [2019-11-26 02:55:06,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:06,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380834370] [2019-11-26 02:55:06,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:06,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:55:06,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650641951] [2019-11-26 02:55:06,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:06,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:06,571 INFO L87 Difference]: Start difference. First operand 855 states and 1121 transitions. Second operand 3 states. [2019-11-26 02:55:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:06,883 INFO L93 Difference]: Finished difference Result 1922 states and 2491 transitions. [2019-11-26 02:55:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:06,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-26 02:55:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:06,889 INFO L225 Difference]: With dead ends: 1922 [2019-11-26 02:55:06,889 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:55:06,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:55:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-11-26 02:55:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:55:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1284 transitions. [2019-11-26 02:55:06,915 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1284 transitions. Word has length 100 [2019-11-26 02:55:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:06,916 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1284 transitions. [2019-11-26 02:55:06,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1284 transitions. [2019-11-26 02:55:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-26 02:55:06,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:06,919 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:55:06,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2113449189, now seen corresponding path program 1 times [2019-11-26 02:55:06,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:06,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529432232] [2019-11-26 02:55:06,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:07,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529432232] [2019-11-26 02:55:07,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:07,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:55:07,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713757434] [2019-11-26 02:55:07,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:55:07,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:55:07,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:55:07,074 INFO L87 Difference]: Start difference. First operand 997 states and 1284 transitions. Second operand 8 states. [2019-11-26 02:55:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:07,778 INFO L93 Difference]: Finished difference Result 2106 states and 2699 transitions. [2019-11-26 02:55:07,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:55:07,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-11-26 02:55:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:07,784 INFO L225 Difference]: With dead ends: 2106 [2019-11-26 02:55:07,785 INFO L226 Difference]: Without dead ends: 1181 [2019-11-26 02:55:07,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:55:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-11-26 02:55:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 997. [2019-11-26 02:55:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:55:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1272 transitions. [2019-11-26 02:55:07,812 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1272 transitions. Word has length 104 [2019-11-26 02:55:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:07,812 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1272 transitions. [2019-11-26 02:55:07,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:55:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1272 transitions. [2019-11-26 02:55:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-26 02:55:07,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:07,816 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:07,817 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 58782268, now seen corresponding path program 1 times [2019-11-26 02:55:07,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:07,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368094015] [2019-11-26 02:55:07,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-26 02:55:07,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368094015] [2019-11-26 02:55:07,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:07,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:55:07,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073169240] [2019-11-26 02:55:07,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:55:07,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:55:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:07,872 INFO L87 Difference]: Start difference. First operand 997 states and 1272 transitions. Second operand 3 states. [2019-11-26 02:55:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:08,148 INFO L93 Difference]: Finished difference Result 1993 states and 2541 transitions. [2019-11-26 02:55:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:08,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-26 02:55:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:08,153 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:55:08,153 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:55:08,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:55:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:55:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-11-26 02:55:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:55:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1067 transitions. [2019-11-26 02:55:08,201 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1067 transitions. Word has length 127 [2019-11-26 02:55:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:08,202 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1067 transitions. [2019-11-26 02:55:08,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:55:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1067 transitions. [2019-11-26 02:55:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-26 02:55:08,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:08,204 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:55:08,204 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:08,205 INFO L82 PathProgramCache]: Analyzing trace with hash 646847506, now seen corresponding path program 1 times [2019-11-26 02:55:08,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:08,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916105481] [2019-11-26 02:55:08,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:08,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916105481] [2019-11-26 02:55:08,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:08,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:55:08,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101150939] [2019-11-26 02:55:08,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:55:08,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:55:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:55:08,313 INFO L87 Difference]: Start difference. First operand 926 states and 1067 transitions. Second operand 4 states. [2019-11-26 02:55:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:08,567 INFO L93 Difference]: Finished difference Result 1851 states and 2146 transitions. [2019-11-26 02:55:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:55:08,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-26 02:55:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:08,573 INFO L225 Difference]: With dead ends: 1851 [2019-11-26 02:55:08,573 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:55:08,574 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-11-26 02:55:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:55:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-26 02:55:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:55:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1119 transitions. [2019-11-26 02:55:08,596 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1119 transitions. Word has length 130 [2019-11-26 02:55:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:08,596 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1119 transitions. [2019-11-26 02:55:08,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:55:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1119 transitions. [2019-11-26 02:55:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-26 02:55:08,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:55:08,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-11-26 02:55:08,600 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:55:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:55:08,600 INFO L82 PathProgramCache]: Analyzing trace with hash -730918157, now seen corresponding path program 1 times [2019-11-26 02:55:08,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:55:08,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744203031] [2019-11-26 02:55:08,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:55:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:55:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:55:09,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744203031] [2019-11-26 02:55:09,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:55:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 02:55:09,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957776192] [2019-11-26 02:55:09,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:55:09,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:55:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:55:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:55:09,037 INFO L87 Difference]: Start difference. First operand 997 states and 1119 transitions. Second operand 12 states. [2019-11-26 02:55:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:55:09,668 INFO L93 Difference]: Finished difference Result 2046 states and 2307 transitions. [2019-11-26 02:55:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:55:09,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-11-26 02:55:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:55:09,669 INFO L225 Difference]: With dead ends: 2046 [2019-11-26 02:55:09,669 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:55:09,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:55:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:55:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:55:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:55:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:55:09,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2019-11-26 02:55:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:55:09,673 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:55:09,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:55:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:55:09,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:55:09,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:55:09,937 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-26 02:55:10,054 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-26 02:55:10,056 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:55:10,057 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:55:10,058 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a20~0 1))) (.cse1 (not (= 1 ~a7~0))) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (= ~a16~0 5)) (not (= 15 ~a8~0)) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))))) [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:55:10,059 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:55:10,060 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:55:10,062 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:55:10,062 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:55:10,062 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:55:10,062 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:55:10,062 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:55:10,062 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:55:10,062 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:55:10,063 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:55:10,064 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:55:10,064 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a20~0 1))) (.cse1 (not (= 1 ~a7~0))) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse4 (= ~a21~0 1))) (or (and .cse0 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (= ~a16~0 5)) (not (= 15 ~a8~0)) (and .cse3 (<= ~a17~0 0) .cse4) (and .cse0 .cse1 .cse3 .cse2 .cse4 (not (= ~a16~0 4))))) [2019-11-26 02:55:10,064 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:55:10,064 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:55:10,065 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:55:10,065 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:55:10,065 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:55:10,065 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:55:10,065 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:55:10,066 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:55:10,066 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:55:10,066 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:55:10,066 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:55:10,066 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:55:10,066 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:55:10,067 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:55:10,068 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:55:10,069 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:55:10,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:55:10 BoogieIcfgContainer [2019-11-26 02:55:10,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:55:10,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:55:10,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:55:10,106 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:55:10,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:55:02" (3/4) ... [2019-11-26 02:55:10,109 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:55:10,137 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:55:10,139 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:55:10,141 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-26 02:55:10,337 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_86cb90c6-6b46-4b5b-9e1d-8d90f5b1a5b5/bin/utaipan/witness.graphml [2019-11-26 02:55:10,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:55:10,339 INFO L168 Benchmark]: Toolchain (without parser) took 10487.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -307.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:55:10,339 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:55:10,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:10,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.30 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:10,341 INFO L168 Benchmark]: Boogie Preprocessor took 97.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:55:10,341 INFO L168 Benchmark]: RCFGBuilder took 1723.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 923.4 MB in the end (delta: 206.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:10,342 INFO L168 Benchmark]: TraceAbstraction took 7759.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 923.4 MB in the beginning and 1.3 GB in the end (delta: -343.2 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:10,342 INFO L168 Benchmark]: Witness Printer took 232.32 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:55:10,345 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 604.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.30 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1723.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 923.4 MB in the end (delta: 206.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7759.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 923.4 MB in the beginning and 1.3 GB in the end (delta: -343.2 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. * Witness Printer took 232.32 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || !(15 == a8)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a20 == 1) && !(1 == a7)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || !(15 == a8)) || ((a12 == 8 && a17 <= 0) && a21 == 1)) || (((((!(a20 == 1) && !(1 == a7)) && a12 == 8) && a17 == 1) && a21 == 1) && !(a16 == 4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.6s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 544 SDtfs, 1406 SDslu, 89 SDs, 0 SdLazy, 3546 SolverSat, 797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 965 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9112 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1134 NumberOfCodeBlocks, 1134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 660221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 439/439 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 correct! Received shutdown request...