./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/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 e002fb6463a65ebb6b75b40986db95c31112380a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:04:43,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:04:43,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:04:43,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:04:43,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:04:43,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:04:43,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:04:43,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:04:43,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:04:43,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:04:43,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:04:43,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:04:43,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:04:43,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:04:43,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:04:43,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:04:43,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:04:43,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:04:43,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:04:43,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:04:43,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:04:43,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:04:43,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:04:43,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:04:43,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:04:43,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:04:43,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:04:43,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:04:43,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:04:43,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:04:43,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:04:43,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:04:43,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:04:43,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:04:43,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:04:43,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:04:43,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:04:43,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:04:43,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:04:43,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:04:43,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:04:43,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:04:43,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:04:43,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:04:43,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:04:43,520 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:04:43,521 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:04:43,521 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:04:43,522 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:04:43,522 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:04:43,522 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:04:43,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:04:43,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:04:43,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:04:43,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:04:43,524 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:04:43,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:04:43,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:04:43,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:04:43,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:04:43,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:04:43,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:04:43,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:04:43,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:04:43,525 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:04:43,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:04:43,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:04:43,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:04:43,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:04:43,525 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_5b063957-8c69-4141-8014-65396e7d20c9/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 -> e002fb6463a65ebb6b75b40986db95c31112380a [2019-12-07 11:04:43,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:04:43,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:04:43,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:04:43,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:04:43,636 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:04:43,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-12-07 11:04:43,672 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/data/82e5a7f8d/c4e4cd0045014f8f8c6e177ec68d4974/FLAG86c004feb [2019-12-07 11:04:44,070 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:04:44,070 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-12-07 11:04:44,079 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/data/82e5a7f8d/c4e4cd0045014f8f8c6e177ec68d4974/FLAG86c004feb [2019-12-07 11:04:44,088 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/data/82e5a7f8d/c4e4cd0045014f8f8c6e177ec68d4974 [2019-12-07 11:04:44,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:04:44,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:04:44,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:04:44,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:04:44,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:04:44,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44, skipping insertion in model container [2019-12-07 11:04:44,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:04:44,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:04:44,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:04:44,396 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:04:44,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:04:44,478 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:04:44,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44 WrapperNode [2019-12-07 11:04:44,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:04:44,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:04:44,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:04:44,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:04:44,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:04:44,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:04:44,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:04:44,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:04:44,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... [2019-12-07 11:04:44,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:04:44,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:04:44,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:04:44,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:04:44,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:04:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:04:44,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:04:45,644 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:04:45,644 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:04:45,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:04:45 BoogieIcfgContainer [2019-12-07 11:04:45,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:04:45,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:04:45,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:04:45,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:04:45,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:04:44" (1/3) ... [2019-12-07 11:04:45,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:04:45, skipping insertion in model container [2019-12-07 11:04:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:04:44" (2/3) ... [2019-12-07 11:04:45,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:04:45, skipping insertion in model container [2019-12-07 11:04:45,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:04:45" (3/3) ... [2019-12-07 11:04:45,651 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2019-12-07 11:04:45,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:04:45,663 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:04:45,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:04:45,690 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:04:45,690 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:04:45,690 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:04:45,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:04:45,691 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:04:45,691 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:04:45,691 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:04:45,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:04:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 11:04:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 11:04:45,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:45,710 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-12-07 11:04:45,710 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1323241759, now seen corresponding path program 1 times [2019-12-07 11:04:45,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:45,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 11:04:45,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:45,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 11:04:45,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:45,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:46,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528924625] [2019-12-07 11:04:46,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:04:46,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:46,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:04:46,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:04:46,015 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 11:04:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:46,388 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 11:04:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:04:46,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 11:04:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:46,402 INFO L225 Difference]: With dead ends: 297 [2019-12-07 11:04:46,402 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 11:04:46,405 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-12-07 11:04:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 11:04:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 11:04:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 11:04:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-12-07 11:04:46,443 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-12-07 11:04:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:46,443 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-12-07 11:04:46,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:04:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-12-07 11:04:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 11:04:46,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:46,446 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-12-07 11:04:46,447 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2123299052, now seen corresponding path program 1 times [2019-12-07 11:04:46,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:46,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 11:04:46,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:46,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 11:04:46,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:46,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:04:46,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240149211] [2019-12-07 11:04:46,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:04:46,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:04:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:04:46,528 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-12-07 11:04:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:46,891 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-12-07 11:04:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:04:46,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 11:04:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:46,895 INFO L225 Difference]: With dead ends: 786 [2019-12-07 11:04:46,895 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 11:04:46,897 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-12-07 11:04:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 11:04:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2019-12-07 11:04:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 11:04:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-12-07 11:04:46,916 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-12-07 11:04:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:46,916 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-12-07 11:04:46,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:04:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-12-07 11:04:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 11:04:46,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:46,919 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-12-07 11:04:46,919 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1800587569, now seen corresponding path program 1 times [2019-12-07 11:04:46,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:46,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664662665] [2019-12-07 11:04:46,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:46,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664662665] [2019-12-07 11:04:46,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:46,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:46,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274590512] [2019-12-07 11:04:46,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:04:46,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:04:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:04:46,960 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-12-07 11:04:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:47,255 INFO L93 Difference]: Finished difference Result 857 states and 1277 transitions. [2019-12-07 11:04:47,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:04:47,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 11:04:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:47,258 INFO L225 Difference]: With dead ends: 857 [2019-12-07 11:04:47,258 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 11:04:47,260 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-12-07 11:04:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 11:04:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 11:04:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 11:04:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-12-07 11:04:47,272 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 92 [2019-12-07 11:04:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:47,273 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-12-07 11:04:47,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:04:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-12-07 11:04:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 11:04:47,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:47,275 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-12-07 11:04:47,275 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:47,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1032091724, now seen corresponding path program 1 times [2019-12-07 11:04:47,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:47,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647967955] [2019-12-07 11:04:47,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:47,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647967955] [2019-12-07 11:04:47,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:47,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:47,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122236457] [2019-12-07 11:04:47,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:47,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:47,311 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-12-07 11:04:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:47,522 INFO L93 Difference]: Finished difference Result 1212 states and 1622 transitions. [2019-12-07 11:04:47,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:47,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 11:04:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:47,525 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 11:04:47,525 INFO L226 Difference]: Without dead ends: 784 [2019-12-07 11:04:47,526 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-12-07 11:04:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-07 11:04:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-12-07 11:04:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 11:04:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2019-12-07 11:04:47,541 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 93 [2019-12-07 11:04:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:47,541 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2019-12-07 11:04:47,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2019-12-07 11:04:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:04:47,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:47,543 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-12-07 11:04:47,543 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash 143197316, now seen corresponding path program 1 times [2019-12-07 11:04:47,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:47,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213173321] [2019-12-07 11:04:47,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:04:47,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213173321] [2019-12-07 11:04:47,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:47,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:47,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027824585] [2019-12-07 11:04:47,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:47,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:47,580 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand 3 states. [2019-12-07 11:04:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:47,793 INFO L93 Difference]: Finished difference Result 1709 states and 2233 transitions. [2019-12-07 11:04:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:47,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 11:04:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:47,797 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 11:04:47,797 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 11:04:47,798 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-12-07 11:04:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 11:04:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 784. [2019-12-07 11:04:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 11:04:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1021 transitions. [2019-12-07 11:04:47,812 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1021 transitions. Word has length 97 [2019-12-07 11:04:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:47,813 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1021 transitions. [2019-12-07 11:04:47,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1021 transitions. [2019-12-07 11:04:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:04:47,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:47,814 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-12-07 11:04:47,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1126555358, now seen corresponding path program 1 times [2019-12-07 11:04:47,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:47,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246175894] [2019-12-07 11:04:47,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:04:47,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246175894] [2019-12-07 11:04:47,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:47,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:47,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980817397] [2019-12-07 11:04:47,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:47,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:47,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:47,846 INFO L87 Difference]: Start difference. First operand 784 states and 1021 transitions. Second operand 3 states. [2019-12-07 11:04:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:48,048 INFO L93 Difference]: Finished difference Result 1638 states and 2133 transitions. [2019-12-07 11:04:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:48,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 11:04:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:48,053 INFO L225 Difference]: With dead ends: 1638 [2019-12-07 11:04:48,053 INFO L226 Difference]: Without dead ends: 855 [2019-12-07 11:04:48,054 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-12-07 11:04:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-07 11:04:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-12-07 11:04:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 11:04:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1021 transitions. [2019-12-07 11:04:48,076 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1021 transitions. Word has length 99 [2019-12-07 11:04:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:48,076 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1021 transitions. [2019-12-07 11:04:48,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1021 transitions. [2019-12-07 11:04:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:04:48,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:48,079 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-12-07 11:04:48,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 397471773, now seen corresponding path program 1 times [2019-12-07 11:04:48,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:48,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171111789] [2019-12-07 11:04:48,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:48,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171111789] [2019-12-07 11:04:48,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:48,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:48,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652548387] [2019-12-07 11:04:48,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:48,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:48,143 INFO L87 Difference]: Start difference. First operand 784 states and 1021 transitions. Second operand 3 states. [2019-12-07 11:04:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:48,357 INFO L93 Difference]: Finished difference Result 1780 states and 2291 transitions. [2019-12-07 11:04:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:48,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 11:04:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:48,362 INFO L225 Difference]: With dead ends: 1780 [2019-12-07 11:04:48,362 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 11:04:48,363 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-12-07 11:04:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 11:04:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-12-07 11:04:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 11:04:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1184 transitions. [2019-12-07 11:04:48,383 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1184 transitions. Word has length 100 [2019-12-07 11:04:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:48,383 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1184 transitions. [2019-12-07 11:04:48,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1184 transitions. [2019-12-07 11:04:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 11:04:48,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:48,385 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-12-07 11:04:48,385 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2113451237, now seen corresponding path program 1 times [2019-12-07 11:04:48,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:48,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749681141] [2019-12-07 11:04:48,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:48,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749681141] [2019-12-07 11:04:48,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:48,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:04:48,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125760964] [2019-12-07 11:04:48,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:04:48,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:48,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:04:48,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:04:48,509 INFO L87 Difference]: Start difference. First operand 926 states and 1184 transitions. Second operand 8 states. [2019-12-07 11:04:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:48,972 INFO L93 Difference]: Finished difference Result 1961 states and 2496 transitions. [2019-12-07 11:04:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:04:48,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-07 11:04:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:48,977 INFO L225 Difference]: With dead ends: 1961 [2019-12-07 11:04:48,977 INFO L226 Difference]: Without dead ends: 1107 [2019-12-07 11:04:48,978 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-12-07 11:04:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-07 11:04:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 926. [2019-12-07 11:04:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 11:04:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1172 transitions. [2019-12-07 11:04:48,995 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1172 transitions. Word has length 104 [2019-12-07 11:04:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:48,995 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1172 transitions. [2019-12-07 11:04:48,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:04:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1172 transitions. [2019-12-07 11:04:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 11:04:48,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:48,997 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-12-07 11:04:48,997 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:48,997 INFO L82 PathProgramCache]: Analyzing trace with hash 646849554, now seen corresponding path program 1 times [2019-12-07 11:04:48,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:48,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345350173] [2019-12-07 11:04:48,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:49,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345350173] [2019-12-07 11:04:49,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:49,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:49,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686967711] [2019-12-07 11:04:49,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:49,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:49,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:49,048 INFO L87 Difference]: Start difference. First operand 926 states and 1172 transitions. Second operand 3 states. [2019-12-07 11:04:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:49,255 INFO L93 Difference]: Finished difference Result 1141 states and 1461 transitions. [2019-12-07 11:04:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:49,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-12-07 11:04:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:49,261 INFO L225 Difference]: With dead ends: 1141 [2019-12-07 11:04:49,261 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 11:04:49,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 11:04:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 997. [2019-12-07 11:04:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 11:04:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1288 transitions. [2019-12-07 11:04:49,285 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1288 transitions. Word has length 130 [2019-12-07 11:04:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:49,285 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1288 transitions. [2019-12-07 11:04:49,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1288 transitions. [2019-12-07 11:04:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 11:04:49,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:49,288 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:49,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1183258047, now seen corresponding path program 1 times [2019-12-07 11:04:49,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:49,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698419966] [2019-12-07 11:04:49,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 11:04:49,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698419966] [2019-12-07 11:04:49,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:49,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:49,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630868626] [2019-12-07 11:04:49,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:49,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:49,342 INFO L87 Difference]: Start difference. First operand 997 states and 1288 transitions. Second operand 3 states. [2019-12-07 11:04:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:49,551 INFO L93 Difference]: Finished difference Result 1993 states and 2573 transitions. [2019-12-07 11:04:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:49,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-12-07 11:04:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:49,555 INFO L225 Difference]: With dead ends: 1993 [2019-12-07 11:04:49,555 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 11:04:49,556 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-12-07 11:04:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 11:04:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-12-07 11:04:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 11:04:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1170 transitions. [2019-12-07 11:04:49,571 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1170 transitions. Word has length 135 [2019-12-07 11:04:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:49,572 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1170 transitions. [2019-12-07 11:04:49,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1170 transitions. [2019-12-07 11:04:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 11:04:49,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:49,574 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 11:04:49,574 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1012112364, now seen corresponding path program 1 times [2019-12-07 11:04:49,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:49,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520801085] [2019-12-07 11:04:49,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 11:04:49,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520801085] [2019-12-07 11:04:49,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:49,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:49,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543933872] [2019-12-07 11:04:49,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:49,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:49,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:49,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:49,631 INFO L87 Difference]: Start difference. First operand 997 states and 1170 transitions. Second operand 3 states. [2019-12-07 11:04:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:49,805 INFO L93 Difference]: Finished difference Result 1993 states and 2339 transitions. [2019-12-07 11:04:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:49,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 11:04:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:49,811 INFO L225 Difference]: With dead ends: 1993 [2019-12-07 11:04:49,811 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 11:04:49,812 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-12-07 11:04:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 11:04:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-12-07 11:04:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 11:04:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1074 transitions. [2019-12-07 11:04:49,831 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1074 transitions. Word has length 165 [2019-12-07 11:04:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:49,832 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1074 transitions. [2019-12-07 11:04:49,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1074 transitions. [2019-12-07 11:04:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-07 11:04:49,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:49,834 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:49,834 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash -289993856, now seen corresponding path program 1 times [2019-12-07 11:04:49,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:49,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903291527] [2019-12-07 11:04:49,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 11:04:49,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903291527] [2019-12-07 11:04:49,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919373877] [2019-12-07 11:04:49,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:50,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:04:50,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:04:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-12-07 11:04:50,120 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:04:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-12-07 11:04:50,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:04:50,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-12-07 11:04:50,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629787438] [2019-12-07 11:04:50,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:50,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:04:50,165 INFO L87 Difference]: Start difference. First operand 926 states and 1074 transitions. Second operand 3 states. [2019-12-07 11:04:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:50,402 INFO L93 Difference]: Finished difference Result 1849 states and 2159 transitions. [2019-12-07 11:04:50,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-12-07 11:04:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:50,402 INFO L225 Difference]: With dead ends: 1849 [2019-12-07 11:04:50,403 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:04:50,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:04:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:04:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:04:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:04:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:04:50,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2019-12-07 11:04:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:50,404 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:04:50,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:04:50,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:04:50,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:50,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:04:50,711 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 11:04:50,712 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 11:04:50,713 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 11:04:50,714 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:04:50,715 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 11:04:50,716 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 11:04:50,717 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 11:04:50,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:04:50 BoogieIcfgContainer [2019-12-07 11:04:50,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:04:50,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:04:50,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:04:50,731 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:04:50,731 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:04:45" (3/4) ... [2019-12-07 11:04:50,734 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:04:50,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2019-12-07 11:04:50,752 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 11:04:50,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 11:04:50,849 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5b063957-8c69-4141-8014-65396e7d20c9/bin/utaipan/witness.graphml [2019-12-07 11:04:50,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:04:50,852 INFO L168 Benchmark]: Toolchain (without parser) took 6759.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:04:50,852 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:04:50,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:04:50,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.97 ms. Allocated memory is still 1.1 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-12-07 11:04:50,853 INFO L168 Benchmark]: Boogie Preprocessor took 47.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:04:50,853 INFO L168 Benchmark]: RCFGBuilder took 1057.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 851.7 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:04:50,853 INFO L168 Benchmark]: TraceAbstraction took 5084.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 851.7 MB in the beginning and 1.2 GB in the end (delta: -299.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:04:50,853 INFO L168 Benchmark]: Witness Printer took 119.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:04:50,855 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.97 ms. Allocated memory is still 1.1 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 47.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1057.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 851.7 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5084.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 851.7 MB in the beginning and 1.2 GB in the end (delta: -299.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 119.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 610 SDtfs, 1009 SDslu, 74 SDs, 0 SdLazy, 3143 SolverSat, 786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 400 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 47 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20956 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 555282 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1362/1455 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...