./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label46_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_label46_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 b933e5eb5edc3f9dba2cad9f501770deba788f6d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:56:29,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:56:29,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:56:29,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:56:29,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:56:29,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:56:29,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:56:29,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:56:29,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:56:29,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:56:29,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:56:29,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:56:29,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:56:29,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:56:29,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:56:29,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:56:29,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:56:29,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:56:29,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:56:29,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:56:29,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:56:29,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:56:29,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:56:29,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:56:29,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:56:29,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:56:29,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:56:29,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:56:29,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:56:29,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:56:29,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:56:29,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:56:29,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:56:29,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:56:29,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:56:29,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:56:29,633 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:56:29,661 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:56:29,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:56:29,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:56:29,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:56:29,668 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:56:29,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:56:29,668 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:56:29,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:56:29,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:56:29,671 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:56:29,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:56:29,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:56:29,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:56:29,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:56:29,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:56:29,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:56:29,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:56:29,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:56:29,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:56:29,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:56:29,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:56:29,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:56:29,676 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 -> b933e5eb5edc3f9dba2cad9f501770deba788f6d [2019-01-12 00:56:29,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:56:29,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:56:29,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:56:29,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:56:29,758 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:56:29,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label46_true-unreach-call_false-termination.c [2019-01-12 00:56:29,816 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53401187/5f6e4ad2af8645408b80170d80fd50e4/FLAGef8262f76 [2019-01-12 00:56:30,403 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:56:30,404 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label46_true-unreach-call_false-termination.c [2019-01-12 00:56:30,419 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53401187/5f6e4ad2af8645408b80170d80fd50e4/FLAGef8262f76 [2019-01-12 00:56:30,656 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53401187/5f6e4ad2af8645408b80170d80fd50e4 [2019-01-12 00:56:30,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:56:30,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:56:30,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:30,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:56:30,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:56:30,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:30" (1/1) ... [2019-01-12 00:56:30,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:30, skipping insertion in model container [2019-01-12 00:56:30,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:56:30" (1/1) ... [2019-01-12 00:56:30,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:56:30,740 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:56:31,192 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:31,206 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:56:31,309 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:56:31,327 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:56:31,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31 WrapperNode [2019-01-12 00:56:31,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:56:31,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:31,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:56:31,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:56:31,337 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:56:31" (1/1) ... [2019-01-12 00:56:31,431 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:56:31" (1/1) ... [2019-01-12 00:56:31,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:56:31,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:56:31,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:56:31,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:56:31,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (1/1) ... [2019-01-12 00:56:31,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:56:31,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:56:31,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:56:31,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:56:31,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (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:56:31,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:56:31,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:56:34,694 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:56:34,695 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:56:34,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:34 BoogieIcfgContainer [2019-01-12 00:56:34,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:56:34,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:56:34,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:56:34,701 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:56:34,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:56:30" (1/3) ... [2019-01-12 00:56:34,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21630ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:34, skipping insertion in model container [2019-01-12 00:56:34,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:56:31" (2/3) ... [2019-01-12 00:56:34,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21630ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:56:34, skipping insertion in model container [2019-01-12 00:56:34,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:34" (3/3) ... [2019-01-12 00:56:34,706 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label46_true-unreach-call_false-termination.c [2019-01-12 00:56:34,716 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:56:34,724 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:56:34,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:56:34,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:56:34,774 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:56:34,775 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:56:34,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:56:34,775 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:56:34,775 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:56:34,775 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:56:34,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:56:34,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:56:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:56:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 00:56:34,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:34,814 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] [2019-01-12 00:56:34,817 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:34,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1952388485, now seen corresponding path program 1 times [2019-01-12 00:56:34,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:34,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:34,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:34,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:35,395 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:56:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:35,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:35,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:35,421 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:56:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:38,174 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-01-12 00:56:38,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:38,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-01-12 00:56:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:38,195 INFO L225 Difference]: With dead ends: 775 [2019-01-12 00:56:38,196 INFO L226 Difference]: Without dead ends: 460 [2019-01-12 00:56:38,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-01-12 00:56:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-01-12 00:56:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-12 00:56:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-01-12 00:56:38,259 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 112 [2019-01-12 00:56:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:38,261 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-01-12 00:56:38,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-01-12 00:56:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 00:56:38,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:38,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:56:38,267 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:38,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1907847920, now seen corresponding path program 1 times [2019-01-12 00:56:38,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:38,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:38,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:38,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:38,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:38,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:38,515 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 4 states. [2019-01-12 00:56:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:40,044 INFO L93 Difference]: Finished difference Result 1180 states and 1740 transitions. [2019-01-12 00:56:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:40,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-01-12 00:56:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:40,052 INFO L225 Difference]: With dead ends: 1180 [2019-01-12 00:56:40,052 INFO L226 Difference]: Without dead ends: 874 [2019-01-12 00:56:40,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-01-12 00:56:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 871. [2019-01-12 00:56:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-01-12 00:56:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1173 transitions. [2019-01-12 00:56:40,099 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1173 transitions. Word has length 116 [2019-01-12 00:56:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:40,100 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1173 transitions. [2019-01-12 00:56:40,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1173 transitions. [2019-01-12 00:56:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-12 00:56:40,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:40,107 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] [2019-01-12 00:56:40,107 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 534684038, now seen corresponding path program 1 times [2019-01-12 00:56:40,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:40,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:40,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:40,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:40,205 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:56:40,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:40,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:40,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:40,206 INFO L87 Difference]: Start difference. First operand 871 states and 1173 transitions. Second operand 4 states. [2019-01-12 00:56:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:43,007 INFO L93 Difference]: Finished difference Result 3159 states and 4264 transitions. [2019-01-12 00:56:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:43,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-01-12 00:56:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:43,020 INFO L225 Difference]: With dead ends: 3159 [2019-01-12 00:56:43,020 INFO L226 Difference]: Without dead ends: 2290 [2019-01-12 00:56:43,022 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:56:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-01-12 00:56:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1432. [2019-01-12 00:56:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-01-12 00:56:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1934 transitions. [2019-01-12 00:56:43,089 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1934 transitions. Word has length 130 [2019-01-12 00:56:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:43,090 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 1934 transitions. [2019-01-12 00:56:43,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1934 transitions. [2019-01-12 00:56:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 00:56:43,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:43,095 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,095 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash -191840543, now seen corresponding path program 1 times [2019-01-12 00:56:43,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:43,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:43,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:56:43,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:43,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:56:43,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:43,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:43,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:43,197 INFO L87 Difference]: Start difference. First operand 1432 states and 1934 transitions. Second operand 3 states. [2019-01-12 00:56:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:43,992 INFO L93 Difference]: Finished difference Result 3841 states and 5156 transitions. [2019-01-12 00:56:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:43,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-01-12 00:56:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:44,004 INFO L225 Difference]: With dead ends: 3841 [2019-01-12 00:56:44,004 INFO L226 Difference]: Without dead ends: 2411 [2019-01-12 00:56:44,006 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:56:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-01-12 00:56:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2019-01-12 00:56:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-01-12 00:56:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3033 transitions. [2019-01-12 00:56:44,057 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3033 transitions. Word has length 132 [2019-01-12 00:56:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:44,057 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 3033 transitions. [2019-01-12 00:56:44,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3033 transitions. [2019-01-12 00:56:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-12 00:56:44,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:44,063 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:56:44,064 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1930928697, now seen corresponding path program 1 times [2019-01-12 00:56:44,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:44,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:44,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:56:44,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:44,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:56:44,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:44,306 INFO L87 Difference]: Start difference. First operand 2411 states and 3033 transitions. Second operand 4 states. [2019-01-12 00:56:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:45,385 INFO L93 Difference]: Finished difference Result 5660 states and 7089 transitions. [2019-01-12 00:56:45,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:45,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-01-12 00:56:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:45,396 INFO L225 Difference]: With dead ends: 5660 [2019-01-12 00:56:45,396 INFO L226 Difference]: Without dead ends: 2124 [2019-01-12 00:56:45,401 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:56:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2019-01-12 00:56:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2124. [2019-01-12 00:56:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2124 states. [2019-01-12 00:56:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2549 transitions. [2019-01-12 00:56:45,442 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2549 transitions. Word has length 139 [2019-01-12 00:56:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:45,443 INFO L480 AbstractCegarLoop]: Abstraction has 2124 states and 2549 transitions. [2019-01-12 00:56:45,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2549 transitions. [2019-01-12 00:56:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 00:56:45,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:45,448 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:56:45,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1824532979, now seen corresponding path program 1 times [2019-01-12 00:56:45,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:45,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 00:56:45,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:45,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:45,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:56:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:56:45,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:45,697 INFO L87 Difference]: Start difference. First operand 2124 states and 2549 transitions. Second operand 4 states. [2019-01-12 00:56:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:46,874 INFO L93 Difference]: Finished difference Result 5089 states and 6115 transitions. [2019-01-12 00:56:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:56:46,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-01-12 00:56:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:46,886 INFO L225 Difference]: With dead ends: 5089 [2019-01-12 00:56:46,886 INFO L226 Difference]: Without dead ends: 2967 [2019-01-12 00:56:46,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:56:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2019-01-12 00:56:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2684. [2019-01-12 00:56:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-01-12 00:56:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3063 transitions. [2019-01-12 00:56:46,936 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3063 transitions. Word has length 156 [2019-01-12 00:56:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:46,936 INFO L480 AbstractCegarLoop]: Abstraction has 2684 states and 3063 transitions. [2019-01-12 00:56:46,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:56:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3063 transitions. [2019-01-12 00:56:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-12 00:56:46,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:46,942 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:56:46,942 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:46,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2044540922, now seen corresponding path program 1 times [2019-01-12 00:56:46,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:46,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:46,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-12 00:56:47,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:47,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:47,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:47,080 INFO L87 Difference]: Start difference. First operand 2684 states and 3063 transitions. Second operand 3 states. [2019-01-12 00:56:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:47,994 INFO L93 Difference]: Finished difference Result 5367 states and 6125 transitions. [2019-01-12 00:56:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:47,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-01-12 00:56:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:48,005 INFO L225 Difference]: With dead ends: 5367 [2019-01-12 00:56:48,005 INFO L226 Difference]: Without dead ends: 2685 [2019-01-12 00:56:48,009 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:56:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2019-01-12 00:56:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2684. [2019-01-12 00:56:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-01-12 00:56:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3009 transitions. [2019-01-12 00:56:48,053 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3009 transitions. Word has length 166 [2019-01-12 00:56:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:48,053 INFO L480 AbstractCegarLoop]: Abstraction has 2684 states and 3009 transitions. [2019-01-12 00:56:48,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3009 transitions. [2019-01-12 00:56:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-12 00:56:48,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:56:48,060 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-01-12 00:56:48,060 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:56:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:56:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash 77820767, now seen corresponding path program 1 times [2019-01-12 00:56:48,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:56:48,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:56:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:48,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:56:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:56:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:56:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-12 00:56:48,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:56:48,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:56:48,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:56:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:56:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:56:48,157 INFO L87 Difference]: Start difference. First operand 2684 states and 3009 transitions. Second operand 3 states. [2019-01-12 00:56:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:50,685 INFO L93 Difference]: Finished difference Result 5787 states and 6454 transitions. [2019-01-12 00:56:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:56:50,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-01-12 00:56:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:50,686 INFO L225 Difference]: With dead ends: 5787 [2019-01-12 00:56:50,686 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:56:50,692 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:56:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:56:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:56:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:56:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:56:50,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 172 [2019-01-12 00:56:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:50,693 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:56:50,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:56:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:56:50,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:56:50,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:56:51,857 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-01-12 00:56:52,114 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-01-12 00:56:52,116 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,117 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,118 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:56:52,119 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,120 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:56:52,121 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:56:52,121 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:56:52,124 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:56:52,124 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:52,125 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:56:52,126 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:56:52,127 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:56:52,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:56:52,128 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:56:52,130 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:56:52,130 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,131 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:56:52,132 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:52,133 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:56:52,134 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~a25~0 1))) (let ((.cse1 (not (= ~a11~0 1))) (.cse3 (not (= ~a28~0 11))) (.cse5 (not (= ~a28~0 10))) (.cse7 (= ~a28~0 9)) (.cse0 (= ~a19~0 1)) (.cse4 (not .cse2)) (.cse6 (= ~a17~0 7))) (or (and .cse0 .cse1) (and .cse2 .cse1 .cse3) (and .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse3) (and .cse6 .cse0 .cse5) (and .cse7 .cse6) (and .cse7 .cse0) (and (= ~a28~0 7) .cse4) (and .cse6 (<= ~a25~0 0))))) [2019-01-12 00:56:52,134 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,134 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,134 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:56:52,134 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:56:52,134 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:56:52,134 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:56:52,135 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 508) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:56:52,136 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:56:52,137 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:56:52,139 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~a25~0 1))) (let ((.cse1 (not (= ~a11~0 1))) (.cse3 (not (= ~a28~0 11))) (.cse5 (not (= ~a28~0 10))) (.cse7 (= ~a28~0 9)) (.cse0 (= ~a19~0 1)) (.cse4 (not .cse2)) (.cse6 (= ~a17~0 7))) (or (and .cse0 .cse1) (and .cse2 .cse1 .cse3) (and .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse3) (and .cse6 .cse0 .cse5) (and .cse7 .cse6) (and .cse7 .cse0) (and (= ~a28~0 7) .cse4) (and .cse6 (<= ~a25~0 0))))) [2019-01-12 00:56:52,139 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:56:52,140 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:56:52,141 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:56:52,142 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:56:52,143 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:56:52,144 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:52,145 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:52,146 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:56:52,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:56:52 BoogieIcfgContainer [2019-01-12 00:56:52,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:56:52,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:56:52,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:56:52,173 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:56:52,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:56:34" (3/4) ... [2019-01-12 00:56:52,178 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:56:52,216 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:56:52,217 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:56:52,424 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:56:52,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:56:52,425 INFO L168 Benchmark]: Toolchain (without parser) took 21763.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 947.3 MB in the beginning and 873.1 MB in the end (delta: 74.3 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:52,426 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:56:52,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 665.04 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.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:56:52,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -215.6 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:52,427 INFO L168 Benchmark]: Boogie Preprocessor took 98.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:52,427 INFO L168 Benchmark]: RCFGBuilder took 3101.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:52,428 INFO L168 Benchmark]: TraceAbstraction took 17474.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.0 GB in the beginning and 891.6 MB in the end (delta: 127.5 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:52,430 INFO L168 Benchmark]: Witness Printer took 251.25 ms. Allocated memory is still 1.3 GB. Free memory was 891.6 MB in the beginning and 873.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:52,432 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 665.04 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.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 166.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -215.6 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3101.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17474.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.0 GB in the beginning and 891.6 MB in the end (delta: 127.5 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. * Witness Printer took 251.25 ms. Allocated memory is still 1.3 GB. Free memory was 891.6 MB in the beginning and 873.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 508]: 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 == 1 && !(a11 == 1)) || ((a25 == 1 && !(a11 == 1)) && !(a28 == 11))) || ((!(a25 == 1) && !(a11 == 1)) && !(a28 == 10))) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || ((a17 == 7 && a19 == 1) && !(a28 == 10))) || (a28 == 9 && a17 == 7)) || (a28 == 9 && a19 == 1)) || (a28 == 7 && !(a25 == 1))) || (a17 == 7 && a25 <= 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((a19 == 1 && !(a11 == 1)) || ((a25 == 1 && !(a11 == 1)) && !(a28 == 11))) || ((!(a25 == 1) && !(a11 == 1)) && !(a28 == 10))) || ((a19 == 1 && a25 == 1) && !(a28 == 11))) || ((a17 == 7 && a19 == 1) && !(a28 == 10))) || (a28 == 9 && a17 == 7)) || (a28 == 9 && a19 == 1)) || (a28 == 7 && !(a25 == 1))) || (a17 == 7 && a25 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 17.3s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1012 SDtfs, 1742 SDslu, 248 SDs, 0 SdLazy, 4756 SolverSat, 817 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2684occurred in iteration=6, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1297 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 66 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1126 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 572 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 1123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1115 ConstructedInterpolants, 0 QuantifiedInterpolants, 298315 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 345/345 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...