./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label36_true-unreach-call.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/Problem15_label36_true-unreach-call.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 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:35:47,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:35:47,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:35:47,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:35:47,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:35:47,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:35:47,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:35:47,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:35:47,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:35:47,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:35:47,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:35:47,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:35:47,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:35:47,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:35:47,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:35:47,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:35:47,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:35:47,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:35:47,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:35:47,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:35:47,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:35:47,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:35:47,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:35:47,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:35:47,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:35:47,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:35:47,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:35:47,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:35:47,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:35:47,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:35:47,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:35:47,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:35:47,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:35:47,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:35:47,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:35:47,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:35:47,701 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:35:47,724 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:35:47,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:35:47,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:35:47,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:35:47,728 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:35:47,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:35:47,728 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:35:47,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:35:47,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:35:47,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:35:47,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:35:47,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:35:47,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:35:47,730 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:35:47,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:35:47,731 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:35:47,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:35:47,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:35:47,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:35:47,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:35:47,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:35:47,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:35:47,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:35:47,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:35:47,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:35:47,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:35:47,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:35:47,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:35:47,735 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 -> 1d96b5cec4d76d1edc3f261f7d8386bd0d5f58f5 [2019-01-12 04:35:47,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:35:47,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:35:47,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:35:47,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:35:47,793 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:35:47,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label36_true-unreach-call.c [2019-01-12 04:35:47,857 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f71a497d/6591a77aadc24c72b93198e4429e8edb/FLAG3182f808e [2019-01-12 04:35:48,462 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:35:48,463 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label36_true-unreach-call.c [2019-01-12 04:35:48,484 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f71a497d/6591a77aadc24c72b93198e4429e8edb/FLAG3182f808e [2019-01-12 04:35:48,651 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f71a497d/6591a77aadc24c72b93198e4429e8edb [2019-01-12 04:35:48,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:35:48,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:35:48,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:35:48,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:35:48,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:35:48,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:35:48" (1/1) ... [2019-01-12 04:35:48,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a621260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:48, skipping insertion in model container [2019-01-12 04:35:48,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:35:48" (1/1) ... [2019-01-12 04:35:48,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:35:48,761 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:35:49,505 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:35:49,514 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:35:50,076 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:35:50,289 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:35:50,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50 WrapperNode [2019-01-12 04:35:50,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:35:50,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:35:50,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:35:50,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:35:50,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:35:50,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:35:50,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:35:50,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:35:50,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (1/1) ... [2019-01-12 04:35:50,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:35:50,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:35:50,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:35:50,707 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:35:50,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (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 04:35:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:35:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:35:57,968 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:35:57,968 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:35:57,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:35:57 BoogieIcfgContainer [2019-01-12 04:35:57,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:35:57,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:35:57,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:35:57,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:35:57,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:35:48" (1/3) ... [2019-01-12 04:35:57,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475785a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:35:57, skipping insertion in model container [2019-01-12 04:35:57,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:35:50" (2/3) ... [2019-01-12 04:35:57,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475785a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:35:57, skipping insertion in model container [2019-01-12 04:35:57,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:35:57" (3/3) ... [2019-01-12 04:35:57,979 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label36_true-unreach-call.c [2019-01-12 04:35:57,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:35:57,999 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:35:58,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:35:58,057 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:35:58,058 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:35:58,058 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:35:58,058 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:35:58,058 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:35:58,058 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:35:58,058 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:35:58,059 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:35:58,059 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:35:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:35:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 04:35:58,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:58,104 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] [2019-01-12 04:35:58,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2019-01-12 04:35:58,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:58,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:58,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:58,670 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:35:58,686 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 04:35:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:58,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:58,711 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:36:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:04,443 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-01-12 04:36:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:04,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-12 04:36:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:04,470 INFO L225 Difference]: With dead ends: 1466 [2019-01-12 04:36:04,470 INFO L226 Difference]: Without dead ends: 974 [2019-01-12 04:36:04,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-01-12 04:36:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-01-12 04:36:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-01-12 04:36:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-01-12 04:36:04,602 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 61 [2019-01-12 04:36:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:04,604 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-01-12 04:36:04,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-01-12 04:36:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-12 04:36:04,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:04,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:04,611 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash 13242671, now seen corresponding path program 1 times [2019-01-12 04:36:04,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:04,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:04,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:04,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:04,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:04,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:04,957 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-01-12 04:36:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:11,429 INFO L93 Difference]: Finished difference Result 3747 states and 5437 transitions. [2019-01-12 04:36:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:11,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-01-12 04:36:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:11,446 INFO L225 Difference]: With dead ends: 3747 [2019-01-12 04:36:11,446 INFO L226 Difference]: Without dead ends: 2777 [2019-01-12 04:36:11,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 04:36:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2019-01-12 04:36:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2019-01-12 04:36:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-01-12 04:36:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3624 transitions. [2019-01-12 04:36:11,564 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3624 transitions. Word has length 126 [2019-01-12 04:36:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:11,565 INFO L480 AbstractCegarLoop]: Abstraction has 2775 states and 3624 transitions. [2019-01-12 04:36:11,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3624 transitions. [2019-01-12 04:36:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-12 04:36:11,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:11,582 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:11,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1978174500, now seen corresponding path program 1 times [2019-01-12 04:36:11,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:11,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 117 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-12 04:36:11,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:11,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:36:11,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:12,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:12,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:12,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:36:12,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:12,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:12,179 INFO L87 Difference]: Start difference. First operand 2775 states and 3624 transitions. Second operand 4 states. [2019-01-12 04:36:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:18,454 INFO L93 Difference]: Finished difference Result 10042 states and 13088 transitions. [2019-01-12 04:36:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:18,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-01-12 04:36:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:18,495 INFO L225 Difference]: With dead ends: 10042 [2019-01-12 04:36:18,495 INFO L226 Difference]: Without dead ends: 7269 [2019-01-12 04:36:18,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 231 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 04:36:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2019-01-12 04:36:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 3073. [2019-01-12 04:36:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-01-12 04:36:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3976 transitions. [2019-01-12 04:36:18,593 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3976 transitions. Word has length 231 [2019-01-12 04:36:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:18,594 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 3976 transitions. [2019-01-12 04:36:18,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3976 transitions. [2019-01-12 04:36:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-01-12 04:36:18,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:18,605 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:18,605 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash 482134373, now seen corresponding path program 1 times [2019-01-12 04:36:18,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:18,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:18,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:19,093 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 04:36:19,398 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:36:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-12 04:36:19,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:19,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:19,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:36:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:36:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:19,660 INFO L87 Difference]: Start difference. First operand 3073 states and 3976 transitions. Second operand 5 states. [2019-01-12 04:36:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:23,447 INFO L93 Difference]: Finished difference Result 7342 states and 9252 transitions. [2019-01-12 04:36:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:23,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 411 [2019-01-12 04:36:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:23,468 INFO L225 Difference]: With dead ends: 7342 [2019-01-12 04:36:23,468 INFO L226 Difference]: Without dead ends: 4271 [2019-01-12 04:36:23,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-01-12 04:36:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-01-12 04:36:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-01-12 04:36:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4928 transitions. [2019-01-12 04:36:23,545 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4928 transitions. Word has length 411 [2019-01-12 04:36:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:23,547 INFO L480 AbstractCegarLoop]: Abstraction has 3971 states and 4928 transitions. [2019-01-12 04:36:23,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:36:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4928 transitions. [2019-01-12 04:36:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-01-12 04:36:23,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:23,560 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:23,560 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1884331539, now seen corresponding path program 1 times [2019-01-12 04:36:23,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:23,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:23,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:23,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:23,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-12 04:36:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:24,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:24,257 INFO L87 Difference]: Start difference. First operand 3971 states and 4928 transitions. Second operand 4 states. [2019-01-12 04:36:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:27,552 INFO L93 Difference]: Finished difference Result 9742 states and 12308 transitions. [2019-01-12 04:36:27,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:27,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-01-12 04:36:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:27,578 INFO L225 Difference]: With dead ends: 9742 [2019-01-12 04:36:27,579 INFO L226 Difference]: Without dead ends: 5773 [2019-01-12 04:36:27,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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 04:36:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2019-01-12 04:36:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5470. [2019-01-12 04:36:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-01-12 04:36:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6685 transitions. [2019-01-12 04:36:27,687 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6685 transitions. Word has length 485 [2019-01-12 04:36:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:27,688 INFO L480 AbstractCegarLoop]: Abstraction has 5470 states and 6685 transitions. [2019-01-12 04:36:27,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6685 transitions. [2019-01-12 04:36:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-01-12 04:36:27,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:27,705 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:27,705 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:27,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1615305343, now seen corresponding path program 1 times [2019-01-12 04:36:27,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:27,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:27,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-01-12 04:36:28,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:28,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:28,362 INFO L87 Difference]: Start difference. First operand 5470 states and 6685 transitions. Second operand 4 states. [2019-01-12 04:36:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:32,074 INFO L93 Difference]: Finished difference Result 10937 states and 13389 transitions. [2019-01-12 04:36:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:32,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2019-01-12 04:36:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:32,097 INFO L225 Difference]: With dead ends: 10937 [2019-01-12 04:36:32,097 INFO L226 Difference]: Without dead ends: 5469 [2019-01-12 04:36:32,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 04:36:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-01-12 04:36:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-01-12 04:36:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-01-12 04:36:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6352 transitions. [2019-01-12 04:36:32,193 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6352 transitions. Word has length 491 [2019-01-12 04:36:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:32,194 INFO L480 AbstractCegarLoop]: Abstraction has 5466 states and 6352 transitions. [2019-01-12 04:36:32,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6352 transitions. [2019-01-12 04:36:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-01-12 04:36:32,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:32,209 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:32,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -739237505, now seen corresponding path program 1 times [2019-01-12 04:36:32,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:32,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:32,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:32,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:33,054 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:36:33,415 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:36:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 534 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-12 04:36:34,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:34,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:36:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:34,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-12 04:36:34,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:34,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:36:34,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:36:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:36:34,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:36:34,397 INFO L87 Difference]: Start difference. First operand 5466 states and 6352 transitions. Second operand 8 states. [2019-01-12 04:36:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:41,161 INFO L93 Difference]: Finished difference Result 12581 states and 14407 transitions. [2019-01-12 04:36:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:36:41,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 514 [2019-01-12 04:36:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:41,179 INFO L225 Difference]: With dead ends: 12581 [2019-01-12 04:36:41,179 INFO L226 Difference]: Without dead ends: 5765 [2019-01-12 04:36:41,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 517 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:36:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2019-01-12 04:36:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5466. [2019-01-12 04:36:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-01-12 04:36:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6053 transitions. [2019-01-12 04:36:41,269 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6053 transitions. Word has length 514 [2019-01-12 04:36:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:41,270 INFO L480 AbstractCegarLoop]: Abstraction has 5466 states and 6053 transitions. [2019-01-12 04:36:41,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:36:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6053 transitions. [2019-01-12 04:36:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-01-12 04:36:41,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:41,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:41,277 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:41,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1317201490, now seen corresponding path program 1 times [2019-01-12 04:36:41,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:41,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:36:41,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:41,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:41,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:41,794 INFO L87 Difference]: Start difference. First operand 5466 states and 6053 transitions. Second operand 4 states. [2019-01-12 04:36:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:44,687 INFO L93 Difference]: Finished difference Result 10932 states and 12110 transitions. [2019-01-12 04:36:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:44,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 517 [2019-01-12 04:36:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:44,697 INFO L225 Difference]: With dead ends: 10932 [2019-01-12 04:36:44,698 INFO L226 Difference]: Without dead ends: 5468 [2019-01-12 04:36:44,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:36:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-01-12 04:36:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5463. [2019-01-12 04:36:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-01-12 04:36:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 5956 transitions. [2019-01-12 04:36:44,788 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 5956 transitions. Word has length 517 [2019-01-12 04:36:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:44,789 INFO L480 AbstractCegarLoop]: Abstraction has 5463 states and 5956 transitions. [2019-01-12 04:36:44,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 5956 transitions. [2019-01-12 04:36:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-01-12 04:36:44,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:44,800 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:44,801 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2096021639, now seen corresponding path program 1 times [2019-01-12 04:36:44,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:44,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:44,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:36:45,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:45,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:45,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:36:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:36:45,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:45,141 INFO L87 Difference]: Start difference. First operand 5463 states and 5956 transitions. Second operand 3 states. [2019-01-12 04:36:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:47,888 INFO L93 Difference]: Finished difference Result 11221 states and 12257 transitions. [2019-01-12 04:36:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:36:47,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-01-12 04:36:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:47,901 INFO L225 Difference]: With dead ends: 11221 [2019-01-12 04:36:47,902 INFO L226 Difference]: Without dead ends: 5760 [2019-01-12 04:36:47,908 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 04:36:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5760 states. [2019-01-12 04:36:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5760 to 5461. [2019-01-12 04:36:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5461 states. [2019-01-12 04:36:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 5952 transitions. [2019-01-12 04:36:47,980 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 5952 transitions. Word has length 562 [2019-01-12 04:36:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:47,981 INFO L480 AbstractCegarLoop]: Abstraction has 5461 states and 5952 transitions. [2019-01-12 04:36:47,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:36:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 5952 transitions. [2019-01-12 04:36:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-01-12 04:36:47,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:47,997 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:47,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1192265330, now seen corresponding path program 1 times [2019-01-12 04:36:48,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:48,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2019-01-12 04:36:48,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:48,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:48,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:48,751 INFO L87 Difference]: Start difference. First operand 5461 states and 5952 transitions. Second operand 4 states. [2019-01-12 04:36:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:53,634 INFO L93 Difference]: Finished difference Result 15404 states and 16757 transitions. [2019-01-12 04:36:53,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:53,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-01-12 04:36:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:53,652 INFO L225 Difference]: With dead ends: 15404 [2019-01-12 04:36:53,653 INFO L226 Difference]: Without dead ends: 7254 [2019-01-12 04:36:53,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:36:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-01-12 04:36:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 7254. [2019-01-12 04:36:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-01-12 04:36:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 7707 transitions. [2019-01-12 04:36:53,868 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 7707 transitions. Word has length 603 [2019-01-12 04:36:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:53,870 INFO L480 AbstractCegarLoop]: Abstraction has 7254 states and 7707 transitions. [2019-01-12 04:36:53,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 7707 transitions. [2019-01-12 04:36:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-01-12 04:36:53,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:53,883 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:53,885 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1143050440, now seen corresponding path program 1 times [2019-01-12 04:36:53,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:53,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:53,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:53,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:36:54,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:54,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:54,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:54,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:54,615 INFO L87 Difference]: Start difference. First operand 7254 states and 7707 transitions. Second operand 4 states. [2019-01-12 04:36:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:56,971 INFO L93 Difference]: Finished difference Result 16864 states and 17924 transitions. [2019-01-12 04:36:56,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:56,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 657 [2019-01-12 04:36:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:56,988 INFO L225 Difference]: With dead ends: 16864 [2019-01-12 04:36:56,989 INFO L226 Difference]: Without dead ends: 7818 [2019-01-12 04:36:56,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7818 states. [2019-01-12 04:36:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7818 to 6316. [2019-01-12 04:36:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-01-12 04:36:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 6550 transitions. [2019-01-12 04:36:57,078 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 6550 transitions. Word has length 657 [2019-01-12 04:36:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:57,079 INFO L480 AbstractCegarLoop]: Abstraction has 6316 states and 6550 transitions. [2019-01-12 04:36:57,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 6550 transitions. [2019-01-12 04:36:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-01-12 04:36:57,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:57,091 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:36:57,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash 940636783, now seen corresponding path program 1 times [2019-01-12 04:36:57,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:57,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:57,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-01-12 04:36:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:57,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:57,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:36:57,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:36:57,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:57,701 INFO L87 Difference]: Start difference. First operand 6316 states and 6550 transitions. Second operand 3 states. [2019-01-12 04:36:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:58,793 INFO L93 Difference]: Finished difference Result 12929 states and 13414 transitions. [2019-01-12 04:36:58,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:36:58,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2019-01-12 04:36:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:58,802 INFO L225 Difference]: With dead ends: 12929 [2019-01-12 04:36:58,802 INFO L226 Difference]: Without dead ends: 6615 [2019-01-12 04:36:58,809 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 04:36:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6615 states. [2019-01-12 04:36:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6615 to 6316. [2019-01-12 04:36:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-01-12 04:36:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 6545 transitions. [2019-01-12 04:36:58,883 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 6545 transitions. Word has length 691 [2019-01-12 04:36:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:58,884 INFO L480 AbstractCegarLoop]: Abstraction has 6316 states and 6545 transitions. [2019-01-12 04:36:58,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:36:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 6545 transitions. [2019-01-12 04:36:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2019-01-12 04:36:58,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:58,900 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:36:58,901 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1105372660, now seen corresponding path program 1 times [2019-01-12 04:36:58,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:58,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:58,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:58,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-01-12 04:36:59,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:59,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:59,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:36:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:36:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:59,540 INFO L87 Difference]: Start difference. First operand 6316 states and 6545 transitions. Second operand 3 states. [2019-01-12 04:37:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:00,864 INFO L93 Difference]: Finished difference Result 13526 states and 14046 transitions. [2019-01-12 04:37:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:00,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 846 [2019-01-12 04:37:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:00,871 INFO L225 Difference]: With dead ends: 13526 [2019-01-12 04:37:00,871 INFO L226 Difference]: Without dead ends: 7212 [2019-01-12 04:37:00,876 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 04:37:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7212 states. [2019-01-12 04:37:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7212 to 6913. [2019-01-12 04:37:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2019-01-12 04:37:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7154 transitions. [2019-01-12 04:37:00,968 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7154 transitions. Word has length 846 [2019-01-12 04:37:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:00,969 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 7154 transitions. [2019-01-12 04:37:00,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7154 transitions. [2019-01-12 04:37:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2019-01-12 04:37:00,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:00,995 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:00,998 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1187839850, now seen corresponding path program 1 times [2019-01-12 04:37:00,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:00,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:01,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-01-12 04:37:01,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:01,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:01,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:01,819 INFO L87 Difference]: Start difference. First operand 6913 states and 7154 transitions. Second operand 4 states. [2019-01-12 04:37:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:04,089 INFO L93 Difference]: Finished difference Result 20115 states and 20748 transitions. [2019-01-12 04:37:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:04,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 867 [2019-01-12 04:37:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:04,104 INFO L225 Difference]: With dead ends: 20115 [2019-01-12 04:37:04,105 INFO L226 Difference]: Without dead ends: 12606 [2019-01-12 04:37:04,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:37:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2019-01-12 04:37:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 7208. [2019-01-12 04:37:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7208 states. [2019-01-12 04:37:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 7401 transitions. [2019-01-12 04:37:04,220 INFO L78 Accepts]: Start accepts. Automaton has 7208 states and 7401 transitions. Word has length 867 [2019-01-12 04:37:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:04,221 INFO L480 AbstractCegarLoop]: Abstraction has 7208 states and 7401 transitions. [2019-01-12 04:37:04,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7208 states and 7401 transitions. [2019-01-12 04:37:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2019-01-12 04:37:04,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:04,240 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:04,240 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:04,240 INFO L82 PathProgramCache]: Analyzing trace with hash -849008212, now seen corresponding path program 1 times [2019-01-12 04:37:04,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:04,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:04,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:04,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:04,989 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 04:37:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1133 proven. 454 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 04:37:06,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:06,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:37:06,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:06,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1775 backedges. 1188 proven. 399 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 04:37:07,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:37:07,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 12 [2019-01-12 04:37:07,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 04:37:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 04:37:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:37:07,529 INFO L87 Difference]: Start difference. First operand 7208 states and 7401 transitions. Second operand 12 states. [2019-01-12 04:37:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:17,768 INFO L93 Difference]: Finished difference Result 19563 states and 20068 transitions. [2019-01-12 04:37:17,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 04:37:17,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1025 [2019-01-12 04:37:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:17,783 INFO L225 Difference]: With dead ends: 19563 [2019-01-12 04:37:17,783 INFO L226 Difference]: Without dead ends: 12357 [2019-01-12 04:37:17,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 1038 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2019-01-12 04:37:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12357 states. [2019-01-12 04:37:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12357 to 9006. [2019-01-12 04:37:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9006 states. [2019-01-12 04:37:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9006 states to 9006 states and 9225 transitions. [2019-01-12 04:37:17,897 INFO L78 Accepts]: Start accepts. Automaton has 9006 states and 9225 transitions. Word has length 1025 [2019-01-12 04:37:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:17,898 INFO L480 AbstractCegarLoop]: Abstraction has 9006 states and 9225 transitions. [2019-01-12 04:37:17,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 04:37:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9006 states and 9225 transitions. [2019-01-12 04:37:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2019-01-12 04:37:17,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:17,916 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:17,916 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1635294930, now seen corresponding path program 1 times [2019-01-12 04:37:17,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:18,718 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-01-12 04:37:18,914 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-12 04:37:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2019-01-12 04:37:19,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:19,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:37:19,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:37:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:37:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:37:19,588 INFO L87 Difference]: Start difference. First operand 9006 states and 9225 transitions. Second operand 5 states. [2019-01-12 04:37:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:22,582 INFO L93 Difference]: Finished difference Result 21907 states and 22427 transitions. [2019-01-12 04:37:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:37:22,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1037 [2019-01-12 04:37:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:22,584 INFO L225 Difference]: With dead ends: 21907 [2019-01-12 04:37:22,584 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:37:22,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:37:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:37:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:37:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:37:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:37:22,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1037 [2019-01-12 04:37:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:22,593 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:37:22,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:37:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:37:22,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:37:22,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:37:22,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:22,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:22,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:22,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:22,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:22,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,059 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 242 [2019-01-12 04:37:23,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,439 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 241 [2019-01-12 04:37:23,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:23,768 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 212 [2019-01-12 04:37:27,593 WARN L181 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 232 DAG size of output: 88 [2019-01-12 04:37:29,343 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 231 DAG size of output: 88 [2019-01-12 04:37:30,880 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 204 DAG size of output: 90 [2019-01-12 04:37:30,890 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,890 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,890 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,890 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,890 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:37:30,890 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,891 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,892 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,893 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,894 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,895 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,896 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:37:30,897 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:37:30,898 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,899 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,900 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,901 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,902 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,903 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,904 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,905 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:37:30,906 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:37:30,907 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,908 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,909 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse19 (+ ~a4~0 86))) (let ((.cse7 (+ ~a0~0 98)) (.cse1 (= ~a2~0 1)) (.cse6 (<= .cse19 0)) (.cse20 (<= 0 (+ ~a0~0 44))) (.cse11 (+ ~a0~0 147)) (.cse2 (+ ~a29~0 144))) (let ((.cse8 (not (= 1 ~a2~0))) (.cse13 (<= 0 .cse2)) (.cse12 (<= (+ ~a4~0 89) 0)) (.cse3 (= ~a2~0 4)) (.cse4 (<= .cse11 0)) (.cse14 (let ((.cse21 (not (= 5 ~a2~0)))) (or (and .cse6 .cse21) (and .cse21 .cse20)))) (.cse18 (or (and .cse6 .cse1) (and .cse1 .cse20))) (.cse10 (< 0 .cse19)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse17 (<= (+ ~a0~0 99) 0)) (.cse15 (= ~a2~0 3)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse9 (<= .cse7 0)) (.cse16 (= ~a2~0 2))) (or (and .cse0 .cse1 (<= ~a29~0 43) (< 0 .cse2)) (and .cse0 .cse3 .cse4) (and .cse5 (and (and .cse6 (< 0 .cse7)) .cse8)) (and .cse9 .cse0 .cse1 .cse10 (< 0 .cse11)) (and .cse5 (and .cse12 .cse8)) (and .cse0 .cse4 .cse8 .cse13) (and .cse10 (and .cse9 .cse0 (not (= 2 ~a2~0)) .cse8 (not (= 4 ~a2~0))) .cse13) (and .cse12 .cse4) (and .cse14 .cse0 .cse15) (and .cse0 .cse3 .cse14) (and .cse16 .cse4) (and .cse17 .cse18) (and .cse14 .cse0 .cse16) (and (<= .cse2 0) .cse18 (<= (+ ~a0~0 61) 0)) (and .cse0 .cse10 .cse17 (<= 8 ~a29~0)) (and .cse0 .cse17 .cse15) (and .cse5 (and .cse9 .cse16)))))) [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,910 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:37:30,911 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,912 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,913 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,913 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,913 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,913 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,913 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse19 (+ ~a4~0 86))) (let ((.cse7 (+ ~a0~0 98)) (.cse6 (<= .cse19 0)) (.cse1 (= ~a2~0 1)) (.cse21 (<= 0 (+ ~a0~0 44))) (.cse11 (+ ~a0~0 147)) (.cse2 (+ ~a29~0 144))) (let ((.cse8 (not (= 1 ~a2~0))) (.cse13 (<= 0 .cse2)) (.cse12 (<= (+ ~a4~0 89) 0)) (.cse3 (= ~a2~0 4)) (.cse4 (<= .cse11 0)) (.cse17 (or (and .cse6 .cse1) (and .cse1 .cse21))) (.cse14 (let ((.cse20 (not (= 5 ~a2~0)))) (or (and .cse6 .cse20) (and .cse20 .cse21)))) (.cse10 (< 0 .cse19)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse18 (<= (+ ~a0~0 99) 0)) (.cse15 (= ~a2~0 3)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse9 (<= .cse7 0)) (.cse16 (= ~a2~0 2))) (or (and .cse0 .cse1 (<= ~a29~0 43) (< 0 .cse2)) (and .cse0 .cse3 .cse4) (and .cse5 (and (and .cse6 (< 0 .cse7)) .cse8)) (and .cse9 .cse0 .cse1 .cse10 (< 0 .cse11)) (and .cse5 (and .cse12 .cse8)) (and (and .cse10 (and .cse9 .cse0 (not (= 2 ~a2~0)) .cse8 (not (= 4 ~a2~0)))) .cse13) (and .cse0 .cse4 .cse8 .cse13) (and .cse12 .cse4) (and .cse14 .cse0 .cse15) (and .cse0 .cse3 .cse14) (and .cse16 .cse4) (and .cse6 (<= .cse2 0) .cse17) (and .cse18 .cse17) (and .cse14 .cse0 .cse16) (and .cse0 .cse10 .cse18 (<= 8 ~a29~0)) (and .cse0 .cse18 .cse15) (and .cse5 (and .cse9 .cse16)))))) [2019-01-12 04:37:30,913 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,914 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:37:30,915 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,916 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,917 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,918 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,919 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse19 (+ ~a4~0 86))) (let ((.cse7 (+ ~a0~0 98)) (.cse6 (<= .cse19 0)) (.cse1 (= ~a2~0 1)) (.cse21 (<= 0 (+ ~a0~0 44))) (.cse11 (+ ~a0~0 147)) (.cse2 (+ ~a29~0 144))) (let ((.cse8 (not (= 1 ~a2~0))) (.cse13 (<= 0 .cse2)) (.cse12 (<= (+ ~a4~0 89) 0)) (.cse3 (= ~a2~0 4)) (.cse4 (<= .cse11 0)) (.cse17 (or (and .cse6 .cse1) (and .cse1 .cse21))) (.cse14 (let ((.cse20 (not (= 5 ~a2~0)))) (or (and .cse6 .cse20) (and .cse20 .cse21)))) (.cse10 (< 0 .cse19)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse18 (<= (+ ~a0~0 99) 0)) (.cse15 (= ~a2~0 3)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse9 (<= .cse7 0)) (.cse16 (= ~a2~0 2))) (or (and .cse0 .cse1 (<= ~a29~0 43) (< 0 .cse2)) (and .cse0 .cse3 .cse4) (and .cse5 (and (and .cse6 (< 0 .cse7)) .cse8)) (and .cse9 .cse0 .cse1 .cse10 (< 0 .cse11)) (and .cse5 (and .cse12 .cse8)) (and (and .cse10 (and .cse9 .cse0 (not (= 2 ~a2~0)) .cse8 (not (= 4 ~a2~0)))) .cse13) (and .cse0 .cse4 .cse8 .cse13) (and .cse12 .cse4) (and .cse14 .cse0 .cse15) (and .cse0 .cse3 .cse14) (and .cse16 .cse4) (and .cse6 (<= .cse2 0) .cse17) (and .cse18 .cse17) (and .cse14 .cse0 .cse16) (and .cse0 .cse10 .cse18 (<= 8 ~a29~0)) (and .cse0 .cse18 .cse15) (and .cse5 (and .cse9 .cse16)))))) [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,920 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,921 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,922 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 190) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,923 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,924 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,925 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:37:30,926 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:37:30,927 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:37:30,928 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:37:30,929 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,929 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,929 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:37:30,929 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:37:30,929 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:37:30,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:37:30 BoogieIcfgContainer [2019-01-12 04:37:30,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:37:30,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:37:30,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:37:30,977 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:37:30,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:35:57" (3/4) ... [2019-01-12 04:37:30,987 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:37:31,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:37:31,073 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:37:31,348 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:37:31,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:37:31,349 INFO L168 Benchmark]: Toolchain (without parser) took 102694.58 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 946.0 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 736.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,350 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:37:31,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1634.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 219.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,351 INFO L168 Benchmark]: Boogie Preprocessor took 194.43 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,352 INFO L168 Benchmark]: RCFGBuilder took 7263.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -128.2 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,352 INFO L168 Benchmark]: TraceAbstraction took 93005.62 ms. Allocated memory was 1.3 GB in the beginning and 3.0 GB in the end (delta: 1.6 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -984.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,352 INFO L168 Benchmark]: Witness Printer took 371.66 ms. Allocated memory is still 3.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:31,355 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1634.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 219.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 194.43 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7263.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -128.2 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93005.62 ms. Allocated memory was 1.3 GB in the beginning and 3.0 GB in the end (delta: 1.6 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -984.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 371.66 ms. Allocated memory is still 3.0 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 190]: 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: 1766]: Loop Invariant Derived loop invariant: ((((((((((((((((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) || ((a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0)) || (0 < a29 + 16 && (a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || (0 < a29 + 16 && a4 + 89 <= 0 && !(1 == a2))) || ((0 < a4 + 86 && (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(2 == a2)) && !(1 == a2)) && !(4 == a2)) && 0 <= a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a29 + 144)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)))) || (a2 == 2 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 99 <= 0) && 8 <= a29)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) || ((a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0)) || (0 < a29 + 16 && (a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || (0 < a29 + 16 && a4 + 89 <= 0 && !(1 == a2))) || ((0 < a4 + 86 && (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(2 == a2)) && !(1 == a2)) && !(4 == a2)) && 0 <= a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a29 + 144)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)))) || (a2 == 2 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 2)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 99 <= 0) && 8 <= a29)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) || ((a4 + 42 <= 0 && a2 == 4) && a0 + 147 <= 0)) || (0 < a29 + 16 && (a4 + 86 <= 0 && 0 < a0 + 98) && !(1 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || (0 < a29 + 16 && a4 + 89 <= 0 && !(1 == a2))) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a29 + 144)) || ((0 < a4 + 86 && (((a0 + 98 <= 0 && a4 + 42 <= 0) && !(2 == a2)) && !(1 == a2)) && !(4 == a2)) && 0 <= a29 + 144)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4) && ((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)))) || (a2 == 2 && a0 + 147 <= 0)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((((a4 + 86 <= 0 && !(5 == a2)) || (!(5 == a2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && a2 == 2)) || ((a29 + 144 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 99 <= 0) && 8 <= a29)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 92.8s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 67.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 4311 SDtfs, 13129 SDslu, 1048 SDs, 0 SdLazy, 32193 SolverSat, 4377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 1811 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9006occurred in iteration=15, 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: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 16258 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 205 NumberOfFragments, 1086 HoareAnnotationTreeSize, 4 FomulaSimplifications, 51961 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 39942 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 10894 NumberOfCodeBlocks, 10894 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 10875 ConstructedInterpolants, 0 QuantifiedInterpolants, 17840055 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 12844/13703 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...