./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94bad701dc31ef8837df5dc0d8bbaaa41b948fd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:55:17,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:55:17,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:55:17,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:55:17,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:55:17,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:55:17,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:55:17,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:55:17,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:55:17,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:55:17,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:55:17,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:55:17,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:55:17,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:55:17,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:55:17,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:55:17,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:55:17,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:55:17,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:55:17,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:55:17,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:55:17,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:55:17,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:55:17,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:55:17,531 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:55:17,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:55:17,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:55:17,534 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:55:17,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:55:17,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:55:17,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:55:17,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:55:17,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:55:17,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:55:17,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:55:17,538 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:55:17,538 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:55:17,558 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:55:17,558 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:55:17,559 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:55:17,559 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:55:17,560 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:55:17,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:55:17,560 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:55:17,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:55:17,560 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:55:17,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:55:17,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:55:17,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:55:17,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:55:17,562 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:55:17,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:55:17,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:55:17,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:55:17,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:55:17,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:55:17,563 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:55:17,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:55:17,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:55:17,563 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> e94bad701dc31ef8837df5dc0d8bbaaa41b948fd [2019-01-12 00:55:17,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:55:17,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:55:17,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:55:17,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:55:17,615 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:55:17,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2019-01-12 00:55:17,673 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77a08ad6/27243e595e5e48a0a0ba14fc31a231a3/FLAG7a7d53052 [2019-01-12 00:55:18,256 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:55:18,257 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2019-01-12 00:55:18,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77a08ad6/27243e595e5e48a0a0ba14fc31a231a3/FLAG7a7d53052 [2019-01-12 00:55:18,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77a08ad6/27243e595e5e48a0a0ba14fc31a231a3 [2019-01-12 00:55:18,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:55:18,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:55:18,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:18,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:55:18,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:55:18,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:18" (1/1) ... [2019-01-12 00:55:18,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b98fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:18, skipping insertion in model container [2019-01-12 00:55:18,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:18" (1/1) ... [2019-01-12 00:55:18,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:55:18,571 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:55:19,008 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:19,013 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:55:19,107 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:19,124 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:55:19,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19 WrapperNode [2019-01-12 00:55:19,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:19,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:19,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:55:19,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:55:19,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:19,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:55:19,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:55:19,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:55:19,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... [2019-01-12 00:55:19,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:55:19,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:55:19,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:55:19,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:55:19,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-12 00:55:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:55:19,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:55:22,565 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:55:22,565 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:55:22,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:22 BoogieIcfgContainer [2019-01-12 00:55:22,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:55:22,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:55:22,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:55:22,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:55:22,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:55:18" (1/3) ... [2019-01-12 00:55:22,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2e89cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:22, skipping insertion in model container [2019-01-12 00:55:22,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:19" (2/3) ... [2019-01-12 00:55:22,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2e89cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:22, skipping insertion in model container [2019-01-12 00:55:22,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:22" (3/3) ... [2019-01-12 00:55:22,577 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label19_true-unreach-call_false-termination.c [2019-01-12 00:55:22,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:55:22,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:55:22,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:55:22,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:55:22,660 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:55:22,660 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:55:22,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:55:22,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:55:22,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:55:22,663 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:55:22,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:55:22,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:55:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:55:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 00:55:22,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:22,702 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:22,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1607169461, now seen corresponding path program 1 times [2019-01-12 00:55:22,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:22,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:22,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:23,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:23,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:23,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:23,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:23,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:23,223 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:55:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:26,193 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-01-12 00:55:26,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:26,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 00:55:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:26,214 INFO L225 Difference]: With dead ends: 789 [2019-01-12 00:55:26,214 INFO L226 Difference]: Without dead ends: 465 [2019-01-12 00:55:26,220 INFO L631 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-01-12 00:55:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-12 00:55:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-01-12 00:55:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-01-12 00:55:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-01-12 00:55:26,284 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 92 [2019-01-12 00:55:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:26,285 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-01-12 00:55:26,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-01-12 00:55:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 00:55:26,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:26,291 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:26,291 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1513780896, now seen corresponding path program 1 times [2019-01-12 00:55:26,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:26,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:26,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:26,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:26,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:26,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:26,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:26,474 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 3 states. [2019-01-12 00:55:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:27,296 INFO L93 Difference]: Finished difference Result 899 states and 1323 transitions. [2019-01-12 00:55:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:27,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-12 00:55:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:27,303 INFO L225 Difference]: With dead ends: 899 [2019-01-12 00:55:27,303 INFO L226 Difference]: Without dead ends: 592 [2019-01-12 00:55:27,306 INFO L631 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-01-12 00:55:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-01-12 00:55:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-01-12 00:55:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-01-12 00:55:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 765 transitions. [2019-01-12 00:55:27,342 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 765 transitions. Word has length 96 [2019-01-12 00:55:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:27,343 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 765 transitions. [2019-01-12 00:55:27,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 765 transitions. [2019-01-12 00:55:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 00:55:27,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:27,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:55:27,350 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash 308279990, now seen corresponding path program 1 times [2019-01-12 00:55:27,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:27,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:27,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:27,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:27,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:27,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:27,512 INFO L87 Difference]: Start difference. First operand 592 states and 765 transitions. Second operand 4 states. [2019-01-12 00:55:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:30,067 INFO L93 Difference]: Finished difference Result 2169 states and 2837 transitions. [2019-01-12 00:55:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:30,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-12 00:55:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:30,080 INFO L225 Difference]: With dead ends: 2169 [2019-01-12 00:55:30,080 INFO L226 Difference]: Without dead ends: 1437 [2019-01-12 00:55:30,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-01-12 00:55:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1150. [2019-01-12 00:55:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-01-12 00:55:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1467 transitions. [2019-01-12 00:55:30,151 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1467 transitions. Word has length 101 [2019-01-12 00:55:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:30,153 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1467 transitions. [2019-01-12 00:55:30,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1467 transitions. [2019-01-12 00:55:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 00:55:30,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:30,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:55:30,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1263008387, now seen corresponding path program 1 times [2019-01-12 00:55:30,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:30,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:30,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:30,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:30,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:30,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:55:30,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:30,271 INFO L87 Difference]: Start difference. First operand 1150 states and 1467 transitions. Second operand 3 states. [2019-01-12 00:55:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:31,243 INFO L93 Difference]: Finished difference Result 3278 states and 4207 transitions. [2019-01-12 00:55:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:31,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-12 00:55:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:31,257 INFO L225 Difference]: With dead ends: 3278 [2019-01-12 00:55:31,257 INFO L226 Difference]: Without dead ends: 2130 [2019-01-12 00:55:31,259 INFO L631 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-01-12 00:55:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-01-12 00:55:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2019-01-12 00:55:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-01-12 00:55:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2333 transitions. [2019-01-12 00:55:31,299 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2333 transitions. Word has length 109 [2019-01-12 00:55:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:31,300 INFO L480 AbstractCegarLoop]: Abstraction has 1850 states and 2333 transitions. [2019-01-12 00:55:31,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2333 transitions. [2019-01-12 00:55:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-12 00:55:31,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:31,305 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:55:31,305 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1854205693, now seen corresponding path program 1 times [2019-01-12 00:55:31,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:31,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:31,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:31,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:31,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:31,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:31,556 INFO L87 Difference]: Start difference. First operand 1850 states and 2333 transitions. Second operand 4 states. [2019-01-12 00:55:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:32,546 INFO L93 Difference]: Finished difference Result 3984 states and 4981 transitions. [2019-01-12 00:55:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:32,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-01-12 00:55:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:32,560 INFO L225 Difference]: With dead ends: 3984 [2019-01-12 00:55:32,561 INFO L226 Difference]: Without dead ends: 2136 [2019-01-12 00:55:32,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-01-12 00:55:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2131. [2019-01-12 00:55:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-01-12 00:55:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2423 transitions. [2019-01-12 00:55:32,604 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2423 transitions. Word has length 150 [2019-01-12 00:55:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:32,604 INFO L480 AbstractCegarLoop]: Abstraction has 2131 states and 2423 transitions. [2019-01-12 00:55:32,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2423 transitions. [2019-01-12 00:55:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 00:55:32,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:32,611 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:55:32,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2077294402, now seen corresponding path program 1 times [2019-01-12 00:55:32,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:32,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:32,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:32,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:32,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:32,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:32,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:32,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:32,741 INFO L87 Difference]: Start difference. First operand 2131 states and 2423 transitions. Second operand 3 states. [2019-01-12 00:55:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:33,400 INFO L93 Difference]: Finished difference Result 4266 states and 4853 transitions. [2019-01-12 00:55:33,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:33,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-01-12 00:55:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:33,411 INFO L225 Difference]: With dead ends: 4266 [2019-01-12 00:55:33,411 INFO L226 Difference]: Without dead ends: 2137 [2019-01-12 00:55:33,415 INFO L631 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-01-12 00:55:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-01-12 00:55:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2131. [2019-01-12 00:55:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-01-12 00:55:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2379 transitions. [2019-01-12 00:55:33,457 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2379 transitions. Word has length 159 [2019-01-12 00:55:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:33,458 INFO L480 AbstractCegarLoop]: Abstraction has 2131 states and 2379 transitions. [2019-01-12 00:55:33,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2379 transitions. [2019-01-12 00:55:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-12 00:55:33,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:33,465 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:55:33,465 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:33,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1420578269, now seen corresponding path program 1 times [2019-01-12 00:55:33,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:33,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:33,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:33,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-12 00:55:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:33,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:33,575 INFO L87 Difference]: Start difference. First operand 2131 states and 2379 transitions. Second operand 4 states. [2019-01-12 00:55:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:34,426 INFO L93 Difference]: Finished difference Result 4258 states and 4754 transitions. [2019-01-12 00:55:34,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:34,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-01-12 00:55:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:34,434 INFO L225 Difference]: With dead ends: 4258 [2019-01-12 00:55:34,435 INFO L226 Difference]: Without dead ends: 2129 [2019-01-12 00:55:34,438 INFO L631 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-01-12 00:55:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-01-12 00:55:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2019-01-12 00:55:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-01-12 00:55:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2307 transitions. [2019-01-12 00:55:34,475 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2307 transitions. Word has length 161 [2019-01-12 00:55:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:34,475 INFO L480 AbstractCegarLoop]: Abstraction has 2129 states and 2307 transitions. [2019-01-12 00:55:34,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2307 transitions. [2019-01-12 00:55:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-12 00:55:34,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:34,482 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:55:34,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash 72359917, now seen corresponding path program 1 times [2019-01-12 00:55:34,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:34,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-12 00:55:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:34,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:34,614 INFO L87 Difference]: Start difference. First operand 2129 states and 2307 transitions. Second operand 3 states. [2019-01-12 00:55:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:35,346 INFO L93 Difference]: Finished difference Result 4538 states and 4924 transitions. [2019-01-12 00:55:35,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:35,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-01-12 00:55:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:35,355 INFO L225 Difference]: With dead ends: 4538 [2019-01-12 00:55:35,355 INFO L226 Difference]: Without dead ends: 2270 [2019-01-12 00:55:35,358 INFO L631 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-01-12 00:55:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-01-12 00:55:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-01-12 00:55:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-01-12 00:55:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2449 transitions. [2019-01-12 00:55:35,392 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2449 transitions. Word has length 170 [2019-01-12 00:55:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:35,392 INFO L480 AbstractCegarLoop]: Abstraction has 2268 states and 2449 transitions. [2019-01-12 00:55:35,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2449 transitions. [2019-01-12 00:55:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-12 00:55:35,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:35,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:55:35,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -648360830, now seen corresponding path program 1 times [2019-01-12 00:55:35,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:35,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:35,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:35,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 00:55:35,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:35,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:35,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:35,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:35,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:35,589 INFO L87 Difference]: Start difference. First operand 2268 states and 2449 transitions. Second operand 4 states. [2019-01-12 00:55:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:39,372 INFO L93 Difference]: Finished difference Result 5239 states and 5687 transitions. [2019-01-12 00:55:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:39,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-01-12 00:55:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:39,382 INFO L225 Difference]: With dead ends: 5239 [2019-01-12 00:55:39,382 INFO L226 Difference]: Without dead ends: 2973 [2019-01-12 00:55:39,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-01-12 00:55:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2689. [2019-01-12 00:55:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-01-12 00:55:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 2886 transitions. [2019-01-12 00:55:39,427 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 2886 transitions. Word has length 171 [2019-01-12 00:55:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:39,427 INFO L480 AbstractCegarLoop]: Abstraction has 2689 states and 2886 transitions. [2019-01-12 00:55:39,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 2886 transitions. [2019-01-12 00:55:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-12 00:55:39,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:39,435 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:55:39,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1613967385, now seen corresponding path program 1 times [2019-01-12 00:55:39,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:39,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:39,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:39,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:39,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:39,768 INFO L87 Difference]: Start difference. First operand 2689 states and 2886 transitions. Second operand 4 states. [2019-01-12 00:55:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:40,902 INFO L93 Difference]: Finished difference Result 5658 states and 6067 transitions. [2019-01-12 00:55:40,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:40,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-01-12 00:55:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:40,909 INFO L225 Difference]: With dead ends: 5658 [2019-01-12 00:55:40,910 INFO L226 Difference]: Without dead ends: 2550 [2019-01-12 00:55:40,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-01-12 00:55:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2406. [2019-01-12 00:55:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-01-12 00:55:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2525 transitions. [2019-01-12 00:55:40,946 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2525 transitions. Word has length 194 [2019-01-12 00:55:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:40,947 INFO L480 AbstractCegarLoop]: Abstraction has 2406 states and 2525 transitions. [2019-01-12 00:55:40,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2525 transitions. [2019-01-12 00:55:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-12 00:55:40,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:40,954 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:55:40,954 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:40,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1509674929, now seen corresponding path program 1 times [2019-01-12 00:55:40,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:40,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:40,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:40,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 00:55:41,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:55:41,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:55:41,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:41,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:55:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-01-12 00:55:41,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:55:41,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-01-12 00:55:41,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:55:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:55:41,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:55:41,570 INFO L87 Difference]: Start difference. First operand 2406 states and 2525 transitions. Second operand 5 states. [2019-01-12 00:55:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:43,498 INFO L93 Difference]: Finished difference Result 4517 states and 4738 transitions. [2019-01-12 00:55:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:43,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-01-12 00:55:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:43,499 INFO L225 Difference]: With dead ends: 4517 [2019-01-12 00:55:43,499 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:55:43,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:55:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:55:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:55:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:55:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:55:43,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2019-01-12 00:55:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:43,503 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:55:43,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:55:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:55:43,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:55:43,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:55:43,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:43,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:43,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:43,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:44,388 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-12 00:55:44,712 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-12 00:55:44,715 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,715 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,716 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,717 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:55:44,718 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:55:44,719 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:44,720 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,721 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:55:44,722 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:55:44,723 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:55:44,724 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:55:44,725 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:55:44,726 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:55:44,726 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:55:44,726 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:55:44,726 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:44,726 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:44,726 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:55:44,727 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse6 (not (= ~a28~0 11))) (.cse4 (= ~a19~0 1)) (.cse2 (<= 10 ~a28~0)) (.cse3 (not .cse9)) (.cse8 (= ~a17~0 8)) (.cse5 (<= ~a11~0 0)) (.cse10 (= ~a28~0 7)) (.cse1 (<= ~a17~0 8)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a11~0 1))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse7 .cse4 .cse5) (and .cse8 .cse5 .cse3 .cse6) (and .cse8 .cse4 .cse5 .cse9) (and .cse8 .cse10 .cse0) (and .cse2 .cse3 .cse0) (and .cse8 .cse5 .cse10) (and .cse10 .cse0 .cse9 .cse1) (and .cse7 .cse0)))) [2019-01-12 00:55:44,727 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,727 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,727 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:55:44,727 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:55:44,727 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:55:44,727 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:55:44,728 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:55:44,729 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse6 (not (= ~a28~0 11))) (.cse4 (= ~a19~0 1)) (.cse2 (<= 10 ~a28~0)) (.cse3 (not .cse9)) (.cse8 (= ~a17~0 8)) (.cse5 (<= ~a11~0 0)) (.cse10 (= ~a28~0 7)) (.cse1 (<= ~a17~0 8)) (.cse7 (= ~a28~0 10)) (.cse0 (= ~a11~0 1))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse7 .cse4 .cse5) (and .cse8 .cse5 .cse3 .cse6) (and .cse8 .cse4 .cse5 .cse9) (and .cse8 .cse10 .cse0) (and .cse2 .cse3 .cse0) (and .cse8 .cse5 .cse10) (and .cse10 .cse0 .cse9 .cse1) (and .cse7 .cse0)))) [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,730 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,731 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,732 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:55:44,733 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:55:44,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,735 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:55:44,736 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:44,737 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:55:44,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:55:44 BoogieIcfgContainer [2019-01-12 00:55:44,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:55:44,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:55:44,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:55:44,759 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:55:44,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:22" (3/4) ... [2019-01-12 00:55:44,763 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:55:44,806 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:55:44,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:55:45,022 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:55:45,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:55:45,027 INFO L168 Benchmark]: Toolchain (without parser) took 26548.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.9 MB). Free memory was 948.7 MB in the beginning and 1.4 GB in the end (delta: -404.1 MB). Peak memory consumption was 489.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,027 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:55:45,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.36 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 920.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -220.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,029 INFO L168 Benchmark]: Boogie Preprocessor took 92.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,029 INFO L168 Benchmark]: RCFGBuilder took 3189.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,030 INFO L168 Benchmark]: TraceAbstraction took 22189.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.0 GB in the beginning and 825.3 MB in the end (delta: 198.1 MB). Peak memory consumption was 403.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,030 INFO L168 Benchmark]: Witness Printer took 267.47 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 6.3 MB). Free memory was 825.3 MB in the beginning and 1.4 GB in the end (delta: -527.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:45,035 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.36 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 920.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -220.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3189.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22189.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.0 GB in the beginning and 825.3 MB in the end (delta: 198.1 MB). Peak memory consumption was 403.7 MB. Max. memory is 11.5 GB. * Witness Printer took 267.47 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 6.3 MB). Free memory was 825.3 MB in the beginning and 1.4 GB in the end (delta: -527.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 448]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11))) || ((a28 == 10 && a17 == 8) && a11 <= 0)) || ((a28 == 10 && a19 == 1) && a11 <= 0)) || (((a17 == 8 && a11 <= 0) && !(a25 == 1)) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a11 <= 0) && a25 == 1)) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || (((a28 == 7 && a11 == 1) && a25 == 1) && a17 <= 8)) || (a28 == 10 && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11))) || ((a28 == 10 && a17 == 8) && a11 <= 0)) || ((a28 == 10 && a19 == 1) && a11 <= 0)) || (((a17 == 8 && a11 <= 0) && !(a25 == 1)) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a11 <= 0) && a25 == 1)) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || (((a28 == 7 && a11 == 1) && a25 == 1) && a17 <= 8)) || (a28 == 10 && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 22.0s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1524 SDtfs, 2767 SDslu, 271 SDs, 0 SdLazy, 5967 SolverSat, 963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 216 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2689occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1164 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 257 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1588 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1805 NumberOfCodeBlocks, 1805 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1793 ConstructedInterpolants, 0 QuantifiedInterpolants, 482822 SizeOfPredicates, 1 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1046/1054 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...