./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label05_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_label05_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 49868ba3cc530a9d4dc385567f0a9711da3734c2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:41,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:54:41,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:54:41,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:54:41,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:54:41,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:54:41,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:54:41,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:54:41,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:54:41,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:54:41,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:54:41,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:54:41,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:54:41,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:54:41,600 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:54:41,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:54:41,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:54:41,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:54:41,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:54:41,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:54:41,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:54:41,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:54:41,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:54:41,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:54:41,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:54:41,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:54:41,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:54:41,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:54:41,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:54:41,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:54:41,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:54:41,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:54:41,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:54:41,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:54:41,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:54:41,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:54:41,620 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:54:41,635 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:54:41,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:54:41,636 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:54:41,637 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:54:41,637 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:54:41,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:54:41,637 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:54:41,637 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:54:41,637 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:54:41,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:54:41,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:54:41,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:54:41,638 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:54:41,638 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:54:41,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:54:41,639 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:54:41,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:54:41,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:54:41,639 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:54:41,639 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:54:41,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:54:41,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:54:41,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:54:41,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:54:41,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:54:41,641 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:54:41,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:54:41,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:54:41,641 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 -> 49868ba3cc530a9d4dc385567f0a9711da3734c2 [2019-01-12 00:54:41,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:54:41,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:54:41,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:54:41,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:54:41,710 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:54:41,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2019-01-12 00:54:41,774 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203cd9f7b/cc5d23abae7b4a1f8ae61d317dc061c2/FLAG0469062e8 [2019-01-12 00:54:42,308 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:54:42,317 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2019-01-12 00:54:42,329 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203cd9f7b/cc5d23abae7b4a1f8ae61d317dc061c2/FLAG0469062e8 [2019-01-12 00:54:42,575 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203cd9f7b/cc5d23abae7b4a1f8ae61d317dc061c2 [2019-01-12 00:54:42,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:54:42,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:54:42,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:42,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:54:42,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:54:42,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:42" (1/1) ... [2019-01-12 00:54:42,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da80eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:42, skipping insertion in model container [2019-01-12 00:54:42,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:42" (1/1) ... [2019-01-12 00:54:42,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:54:42,663 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:54:43,160 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:43,165 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:54:43,290 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:43,312 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:54:43,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43 WrapperNode [2019-01-12 00:54:43,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:43,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:43,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:54:43,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:54:43,326 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:54:43" (1/1) ... [2019-01-12 00:54:43,364 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:54:43" (1/1) ... [2019-01-12 00:54:43,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:43,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:54:43,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:54:43,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:54:43,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (1/1) ... [2019-01-12 00:54:43,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:54:43,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:54:43,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:54:43,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:54:43,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (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:54:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:54:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:54:46,768 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:54:46,770 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:54:46,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:46 BoogieIcfgContainer [2019-01-12 00:54:46,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:54:46,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:54:46,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:54:46,776 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:54:46,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:54:42" (1/3) ... [2019-01-12 00:54:46,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367d1a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:46, skipping insertion in model container [2019-01-12 00:54:46,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:43" (2/3) ... [2019-01-12 00:54:46,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367d1a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:46, skipping insertion in model container [2019-01-12 00:54:46,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:46" (3/3) ... [2019-01-12 00:54:46,781 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2019-01-12 00:54:46,791 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:54:46,806 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:54:46,824 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:54:46,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:54:46,872 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:54:46,873 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:54:46,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:54:46,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:54:46,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:54:46,873 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:54:46,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:54:46,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:54:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:54:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-12 00:54:46,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:46,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:46,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 224978685, now seen corresponding path program 1 times [2019-01-12 00:54:46,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:46,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:47,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:47,647 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:54:47,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:47,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:47,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:47,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:47,672 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:54:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:50,491 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-01-12 00:54:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:50,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-01-12 00:54:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:50,513 INFO L225 Difference]: With dead ends: 739 [2019-01-12 00:54:50,514 INFO L226 Difference]: Without dead ends: 445 [2019-01-12 00:54:50,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-01-12 00:54:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-01-12 00:54:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-01-12 00:54:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-01-12 00:54:50,594 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 126 [2019-01-12 00:54:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:50,595 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-01-12 00:54:50,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-01-12 00:54:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-12 00:54:50,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:50,604 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,604 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2036409026, now seen corresponding path program 1 times [2019-01-12 00:54:50,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:50,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:50,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:50,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:50,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:50,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:50,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:50,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:50,783 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-01-12 00:54:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:52,027 INFO L93 Difference]: Finished difference Result 1468 states and 2192 transitions. [2019-01-12 00:54:52,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:52,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-01-12 00:54:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:52,037 INFO L225 Difference]: With dead ends: 1468 [2019-01-12 00:54:52,037 INFO L226 Difference]: Without dead ends: 1025 [2019-01-12 00:54:52,041 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:54:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-01-12 00:54:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 729. [2019-01-12 00:54:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-01-12 00:54:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1052 transitions. [2019-01-12 00:54:52,090 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1052 transitions. Word has length 144 [2019-01-12 00:54:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:52,090 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 1052 transitions. [2019-01-12 00:54:52,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1052 transitions. [2019-01-12 00:54:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 00:54:52,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:52,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:52,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash 562597236, now seen corresponding path program 1 times [2019-01-12 00:54:52,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:52,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:52,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:52,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:52,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:52,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:54:52,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:52,212 INFO L87 Difference]: Start difference. First operand 729 states and 1052 transitions. Second operand 3 states. [2019-01-12 00:54:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:54,349 INFO L93 Difference]: Finished difference Result 2019 states and 2906 transitions. [2019-01-12 00:54:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:54,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-12 00:54:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:54,359 INFO L225 Difference]: With dead ends: 2019 [2019-01-12 00:54:54,359 INFO L226 Difference]: Without dead ends: 1292 [2019-01-12 00:54:54,361 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:54:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-01-12 00:54:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-01-12 00:54:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-01-12 00:54:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1740 transitions. [2019-01-12 00:54:54,416 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1740 transitions. Word has length 148 [2019-01-12 00:54:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:54,418 INFO L480 AbstractCegarLoop]: Abstraction has 1292 states and 1740 transitions. [2019-01-12 00:54:54,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1740 transitions. [2019-01-12 00:54:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 00:54:54,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:54,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash -427762560, now seen corresponding path program 1 times [2019-01-12 00:54:54,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:54,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:54,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:54,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:54,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:54,618 INFO L87 Difference]: Start difference. First operand 1292 states and 1740 transitions. Second operand 4 states. [2019-01-12 00:54:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:55,931 INFO L93 Difference]: Finished difference Result 3847 states and 5106 transitions. [2019-01-12 00:54:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:55,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-01-12 00:54:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:55,944 INFO L225 Difference]: With dead ends: 3847 [2019-01-12 00:54:55,944 INFO L226 Difference]: Without dead ends: 2557 [2019-01-12 00:54:55,946 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:54:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-01-12 00:54:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2133. [2019-01-12 00:54:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-01-12 00:54:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2651 transitions. [2019-01-12 00:54:55,993 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2651 transitions. Word has length 157 [2019-01-12 00:54:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:55,994 INFO L480 AbstractCegarLoop]: Abstraction has 2133 states and 2651 transitions. [2019-01-12 00:54:55,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2651 transitions. [2019-01-12 00:54:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-12 00:54:56,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:56,000 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 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:54:56,000 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1377673417, now seen corresponding path program 1 times [2019-01-12 00:54:56,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:56,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:54:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:56,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:56,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:56,126 INFO L87 Difference]: Start difference. First operand 2133 states and 2651 transitions. Second operand 4 states. [2019-01-12 00:54:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:56,809 INFO L93 Difference]: Finished difference Result 4264 states and 5300 transitions. [2019-01-12 00:54:56,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:56,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-01-12 00:54:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:56,819 INFO L225 Difference]: With dead ends: 4264 [2019-01-12 00:54:56,819 INFO L226 Difference]: Without dead ends: 2133 [2019-01-12 00:54:56,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2019-01-12 00:54:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1713. [2019-01-12 00:54:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-01-12 00:54:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2014 transitions. [2019-01-12 00:54:56,858 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2014 transitions. Word has length 164 [2019-01-12 00:54:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:56,859 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2014 transitions. [2019-01-12 00:54:56,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2014 transitions. [2019-01-12 00:54:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 00:54:56,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:56,865 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,866 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 598951767, now seen corresponding path program 1 times [2019-01-12 00:54:56,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:56,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:56,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 00:54:56,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:56,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:56,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:56,990 INFO L87 Difference]: Start difference. First operand 1713 states and 2014 transitions. Second operand 3 states. [2019-01-12 00:54:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:57,823 INFO L93 Difference]: Finished difference Result 3710 states and 4325 transitions. [2019-01-12 00:54:57,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:57,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-01-12 00:54:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:57,831 INFO L225 Difference]: With dead ends: 3710 [2019-01-12 00:54:57,832 INFO L226 Difference]: Without dead ends: 1857 [2019-01-12 00:54:57,834 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:54:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2019-01-12 00:54:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1711. [2019-01-12 00:54:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-01-12 00:54:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 1947 transitions. [2019-01-12 00:54:57,863 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 1947 transitions. Word has length 177 [2019-01-12 00:54:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:57,864 INFO L480 AbstractCegarLoop]: Abstraction has 1711 states and 1947 transitions. [2019-01-12 00:54:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 1947 transitions. [2019-01-12 00:54:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-12 00:54:57,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:57,870 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:57,870 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1414473184, now seen corresponding path program 1 times [2019-01-12 00:54:57,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:57,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:57,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 00:54:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:58,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:58,007 INFO L87 Difference]: Start difference. First operand 1711 states and 1947 transitions. Second operand 3 states. [2019-01-12 00:54:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:59,098 INFO L93 Difference]: Finished difference Result 4116 states and 4672 transitions. [2019-01-12 00:54:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:59,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-12 00:54:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:59,104 INFO L225 Difference]: With dead ends: 4116 [2019-01-12 00:54:59,105 INFO L226 Difference]: Without dead ends: 1704 [2019-01-12 00:54:59,107 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:54:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-01-12 00:54:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1564. [2019-01-12 00:54:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2019-01-12 00:54:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1712 transitions. [2019-01-12 00:54:59,131 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1712 transitions. Word has length 186 [2019-01-12 00:54:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:59,132 INFO L480 AbstractCegarLoop]: Abstraction has 1564 states and 1712 transitions. [2019-01-12 00:54:59,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1712 transitions. [2019-01-12 00:54:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-12 00:54:59,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:59,137 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:59,138 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 9217155, now seen corresponding path program 1 times [2019-01-12 00:54:59,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:59,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:59,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:59,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:59,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:59,540 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:54:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 00:54:59,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:54:59,605 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:54:59,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:59,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:54:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 00:54:59,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:54:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:54:59,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:54:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:54:59,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:54:59,929 INFO L87 Difference]: Start difference. First operand 1564 states and 1712 transitions. Second operand 8 states. [2019-01-12 00:55:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:05,215 INFO L93 Difference]: Finished difference Result 2997 states and 3254 transitions. [2019-01-12 00:55:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:55:05,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 200 [2019-01-12 00:55:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:05,216 INFO L225 Difference]: With dead ends: 2997 [2019-01-12 00:55:05,217 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:55:05,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-12 00:55:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:55:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:55:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:55:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:55:05,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2019-01-12 00:55:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:05,221 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:55:05,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:55:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:55:05,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:55:05,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:55:05,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:05,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:06,275 WARN L181 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-01-12 00:55:06,492 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-01-12 00:55:06,495 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,495 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,495 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,495 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:55:06,495 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:55:06,495 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:55:06,496 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:55:06,497 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:55:06,498 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,499 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,500 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:55:06,501 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,502 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:55:06,503 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:55:06,504 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:55:06,505 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:55:06,506 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:55:06,507 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:55:06,507 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:55:06,507 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:55:06,507 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:06,507 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:06,507 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse8 (not .cse9)) (.cse5 (= ~a17~0 8))) (let ((.cse1 (and .cse8 .cse5)) (.cse0 (<= ~a19~0 0)) (.cse4 (not (= ~a28~0 11))) (.cse7 (<= ~a17~0 7)) (.cse2 (= ~a19~0 1)) (.cse6 (= ~a21~0 1)) (.cse3 (= ~a11~0 1))) (or (and .cse0 .cse1) (and .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse8 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse2 .cse6 .cse9 (not .cse3)) (and .cse5 .cse2 .cse9 .cse4) (and .cse0 .cse4) (and .cse7 .cse2 (= ~a28~0 7) .cse6 .cse3))))) [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:06,508 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:55:06,509 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse8 (not .cse9)) (.cse5 (= ~a17~0 8))) (let ((.cse1 (and .cse8 .cse5)) (.cse0 (<= ~a19~0 0)) (.cse4 (not (= ~a28~0 11))) (.cse7 (<= ~a17~0 7)) (.cse2 (= ~a19~0 1)) (.cse6 (= ~a21~0 1)) (.cse3 (= ~a11~0 1))) (or (and .cse0 .cse1) (and .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse8 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse2 .cse6 .cse9 (not .cse3)) (and .cse5 .cse2 .cse9 .cse4) (and .cse0 .cse4) (and .cse7 .cse2 (= ~a28~0 7) .cse6 .cse3))))) [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,510 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:55:06,511 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:55:06,512 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:55:06,513 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:55:06,514 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,515 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,515 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,515 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:55:06,515 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:55:06,517 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:55:06,517 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:55:06,517 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:55:06,518 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:06,519 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:55:06,520 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:06,520 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:55:06,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:55:06 BoogieIcfgContainer [2019-01-12 00:55:06,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:55:06,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:55:06,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:55:06,541 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:55:06,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:46" (3/4) ... [2019-01-12 00:55:06,545 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:55:06,575 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:55:06,576 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:55:06,795 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:55:06,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:55:06,797 INFO L168 Benchmark]: Toolchain (without parser) took 24216.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -309.8 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,797 INFO L168 Benchmark]: CDTParser took 0.15 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:06,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.77 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 911.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 234.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 911.1 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,800 INFO L168 Benchmark]: Boogie Preprocessor took 97.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,800 INFO L168 Benchmark]: RCFGBuilder took 3125.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,800 INFO L168 Benchmark]: TraceAbstraction took 19767.99 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 987.3 MB in the beginning and 1.3 GB in the end (delta: -290.1 MB). Peak memory consumption was 369.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,801 INFO L168 Benchmark]: Witness Printer took 254.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:06,805 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.15 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 730.77 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 911.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 234.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 911.1 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3125.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19767.99 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 987.3 MB in the beginning and 1.3 GB in the end (delta: -290.1 MB). Peak memory consumption was 369.9 MB. Max. memory is 11.5 GB. * Witness Printer took 254.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: (((((((a19 <= 0 && !(a25 == 1) && a17 == 8) || ((((!(a25 == 1) && a17 == 8) && a19 == 1) && a11 == 1) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (((a17 <= 7 && a19 == 1) && !(a25 == 1)) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || (a19 <= 0 && !(a28 == 11))) || ((((a17 <= 7 && a19 == 1) && a28 == 7) && a21 == 1) && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((a19 <= 0 && !(a25 == 1) && a17 == 8) || ((((!(a25 == 1) && a17 == 8) && a19 == 1) && a11 == 1) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (((a17 <= 7 && a19 == 1) && !(a25 == 1)) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || (a19 <= 0 && !(a28 == 11))) || ((((a17 <= 7 && a19 == 1) && a28 == 7) && a21 == 1) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 19.6s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1028 SDtfs, 2406 SDslu, 286 SDs, 0 SdLazy, 5421 SolverSat, 878 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2133occurred in iteration=4, 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1426 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 239 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1002 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 518 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1502 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1493 ConstructedInterpolants, 0 QuantifiedInterpolants, 441936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 611/614 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...