java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:50:05,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:50:05,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:50:05,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:50:05,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:50:05,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:50:05,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:50:05,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:50:05,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:50:05,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:50:05,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:50:05,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:50:05,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:50:05,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:50:05,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:50:05,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:50:05,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:50:05,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:50:05,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:50:05,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:50:05,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:50:05,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:50:05,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:50:05,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:50:05,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:50:05,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:50:05,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:50:05,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:50:05,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:50:05,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:50:05,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:50:05,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:50:05,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:50:05,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:50:05,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:50:05,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:50:05,318 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:50:05,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:50:05,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:50:05,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:50:05,345 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:50:05,345 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:50:05,346 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:50:05,349 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:50:05,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:50:05,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:50:05,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:50:05,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:50:05,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:50:05,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:50:05,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:50:05,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:50:05,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:50:05,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:50:05,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:50:05,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:50:05,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:50:05,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:50:05,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:50:05,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:50:05,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:50:05,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:50:05,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:50:05,354 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:50:05,354 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:50:05,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:50:05,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:50:05,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:50:05,433 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:50:05,434 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:50:05,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c [2018-11-06 19:50:05,499 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ecceebe/5d2a26a19b0d42a7b683edcfab3a2dfa/FLAG2ca6d78fb [2018-11-06 19:50:06,072 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:50:06,073 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c [2018-11-06 19:50:06,091 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ecceebe/5d2a26a19b0d42a7b683edcfab3a2dfa/FLAG2ca6d78fb [2018-11-06 19:50:06,104 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ecceebe/5d2a26a19b0d42a7b683edcfab3a2dfa [2018-11-06 19:50:06,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:50:06,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:50:06,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:06,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:50:06,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:50:06,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:06,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2964f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06, skipping insertion in model container [2018-11-06 19:50:06,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:06,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:50:06,199 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:50:06,701 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:06,707 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:50:06,833 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:06,852 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:50:06,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06 WrapperNode [2018-11-06 19:50:06,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:06,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:06,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:50:06,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:50:06,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:06,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:07,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:50:07,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:50:07,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:50:07,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (1/1) ... [2018-11-06 19:50:07,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:50:07,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:50:07,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:50:07,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:50:07,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (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 [2018-11-06 19:50:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:50:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:50:07,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:50:10,641 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:50:10,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:10 BoogieIcfgContainer [2018-11-06 19:50:10,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:50:10,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:50:10,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:50:10,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:50:10,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:50:06" (1/3) ... [2018-11-06 19:50:10,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e3518f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:10, skipping insertion in model container [2018-11-06 19:50:10,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:06" (2/3) ... [2018-11-06 19:50:10,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e3518f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:10, skipping insertion in model container [2018-11-06 19:50:10,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:10" (3/3) ... [2018-11-06 19:50:10,651 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label40_true-unreach-call_false-termination.c [2018-11-06 19:50:10,662 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:50:10,671 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:50:10,690 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:50:10,735 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:50:10,736 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:50:10,736 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:50:10,736 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:50:10,736 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:50:10,737 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:50:10,737 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:50:10,737 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:50:10,737 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:50:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:50:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-06 19:50:10,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:10,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:10,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:10,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1822031855, now seen corresponding path program 1 times [2018-11-06 19:50:10,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:11,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:11,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:11,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:11,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:11,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:11,565 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:50:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:13,940 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-11-06 19:50:13,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:13,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-06 19:50:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:13,964 INFO L225 Difference]: With dead ends: 666 [2018-11-06 19:50:13,964 INFO L226 Difference]: Without dead ends: 460 [2018-11-06 19:50:13,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-06 19:50:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-11-06 19:50:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-06 19:50:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 732 transitions. [2018-11-06 19:50:14,043 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 732 transitions. Word has length 88 [2018-11-06 19:50:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:14,044 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 732 transitions. [2018-11-06 19:50:14,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 732 transitions. [2018-11-06 19:50:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-06 19:50:14,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:14,050 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:14,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:14,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash -855173694, now seen corresponding path program 1 times [2018-11-06 19:50:14,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:14,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:14,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:14,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:14,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:14,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:14,185 INFO L87 Difference]: Start difference. First operand 460 states and 732 transitions. Second operand 4 states. [2018-11-06 19:50:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:15,817 INFO L93 Difference]: Finished difference Result 1710 states and 2800 transitions. [2018-11-06 19:50:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:15,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-06 19:50:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:15,826 INFO L225 Difference]: With dead ends: 1710 [2018-11-06 19:50:15,826 INFO L226 Difference]: Without dead ends: 1252 [2018-11-06 19:50:15,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-11-06 19:50:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-11-06 19:50:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-11-06 19:50:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1863 transitions. [2018-11-06 19:50:15,901 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1863 transitions. Word has length 95 [2018-11-06 19:50:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:15,902 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1863 transitions. [2018-11-06 19:50:15,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1863 transitions. [2018-11-06 19:50:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-06 19:50:15,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:15,915 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:50:15,915 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:15,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 199940793, now seen corresponding path program 1 times [2018-11-06 19:50:15,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:15,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:15,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:15,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:15,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:50:16,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:16,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:16,047 INFO L87 Difference]: Start difference. First operand 1252 states and 1863 transitions. Second operand 3 states. [2018-11-06 19:50:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:19,022 INFO L93 Difference]: Finished difference Result 2898 states and 4404 transitions. [2018-11-06 19:50:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:19,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-06 19:50:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:19,035 INFO L225 Difference]: With dead ends: 2898 [2018-11-06 19:50:19,036 INFO L226 Difference]: Without dead ends: 1648 [2018-11-06 19:50:19,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-11-06 19:50:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2018-11-06 19:50:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2018-11-06 19:50:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2495 transitions. [2018-11-06 19:50:19,085 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2495 transitions. Word has length 116 [2018-11-06 19:50:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:19,086 INFO L480 AbstractCegarLoop]: Abstraction has 1648 states and 2495 transitions. [2018-11-06 19:50:19,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2495 transitions. [2018-11-06 19:50:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 19:50:19,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:19,093 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:50:19,093 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:19,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1625557622, now seen corresponding path program 1 times [2018-11-06 19:50:19,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:19,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:19,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-06 19:50:19,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:19,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:19,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:19,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:19,231 INFO L87 Difference]: Start difference. First operand 1648 states and 2495 transitions. Second operand 3 states. [2018-11-06 19:50:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:20,110 INFO L93 Difference]: Finished difference Result 4482 states and 6740 transitions. [2018-11-06 19:50:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:20,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-06 19:50:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:20,126 INFO L225 Difference]: With dead ends: 4482 [2018-11-06 19:50:20,126 INFO L226 Difference]: Without dead ends: 2836 [2018-11-06 19:50:20,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2018-11-06 19:50:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2836. [2018-11-06 19:50:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2018-11-06 19:50:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 3941 transitions. [2018-11-06 19:50:20,198 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 3941 transitions. Word has length 154 [2018-11-06 19:50:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:20,198 INFO L480 AbstractCegarLoop]: Abstraction has 2836 states and 3941 transitions. [2018-11-06 19:50:20,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3941 transitions. [2018-11-06 19:50:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-06 19:50:20,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:20,206 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:20,206 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:20,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1689925769, now seen corresponding path program 1 times [2018-11-06 19:50:20,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:20,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 19:50:20,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:20,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:20,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:20,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:20,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:20,337 INFO L87 Difference]: Start difference. First operand 2836 states and 3941 transitions. Second operand 3 states. [2018-11-06 19:50:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:21,462 INFO L93 Difference]: Finished difference Result 8178 states and 11311 transitions. [2018-11-06 19:50:21,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:21,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-06 19:50:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:21,485 INFO L225 Difference]: With dead ends: 8178 [2018-11-06 19:50:21,485 INFO L226 Difference]: Without dead ends: 5344 [2018-11-06 19:50:21,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-11-06 19:50:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2018-11-06 19:50:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-11-06 19:50:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 6994 transitions. [2018-11-06 19:50:21,588 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 6994 transitions. Word has length 174 [2018-11-06 19:50:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:21,588 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 6994 transitions. [2018-11-06 19:50:21,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 6994 transitions. [2018-11-06 19:50:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-06 19:50:21,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:21,598 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:21,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:21,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 669797875, now seen corresponding path program 1 times [2018-11-06 19:50:21,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:21,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:50:21,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:21,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:21,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:21,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:21,806 INFO L87 Difference]: Start difference. First operand 5344 states and 6994 transitions. Second operand 3 states. [2018-11-06 19:50:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:22,790 INFO L93 Difference]: Finished difference Result 10818 states and 14181 transitions. [2018-11-06 19:50:22,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:22,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-06 19:50:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:22,809 INFO L225 Difference]: With dead ends: 10818 [2018-11-06 19:50:22,809 INFO L226 Difference]: Without dead ends: 5476 [2018-11-06 19:50:22,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2018-11-06 19:50:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5476. [2018-11-06 19:50:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2018-11-06 19:50:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7090 transitions. [2018-11-06 19:50:22,905 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7090 transitions. Word has length 176 [2018-11-06 19:50:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:22,906 INFO L480 AbstractCegarLoop]: Abstraction has 5476 states and 7090 transitions. [2018-11-06 19:50:22,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7090 transitions. [2018-11-06 19:50:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-06 19:50:22,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:22,915 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:22,915 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:22,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 368006475, now seen corresponding path program 1 times [2018-11-06 19:50:22,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:22,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:22,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:22,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:22,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:23,545 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-11-06 19:50:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-06 19:50:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:23,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:50:23,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:50:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:50:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:50:23,680 INFO L87 Difference]: Start difference. First operand 5476 states and 7090 transitions. Second operand 7 states. [2018-11-06 19:50:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:25,749 INFO L93 Difference]: Finished difference Result 11026 states and 14254 transitions. [2018-11-06 19:50:25,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:50:25,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2018-11-06 19:50:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:25,769 INFO L225 Difference]: With dead ends: 11026 [2018-11-06 19:50:25,769 INFO L226 Difference]: Without dead ends: 5552 [2018-11-06 19:50:25,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:50:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5552 states. [2018-11-06 19:50:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5552 to 5476. [2018-11-06 19:50:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2018-11-06 19:50:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7066 transitions. [2018-11-06 19:50:25,858 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7066 transitions. Word has length 181 [2018-11-06 19:50:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:25,859 INFO L480 AbstractCegarLoop]: Abstraction has 5476 states and 7066 transitions. [2018-11-06 19:50:25,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:50:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7066 transitions. [2018-11-06 19:50:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-06 19:50:25,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:25,868 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:25,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:25,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash -125735268, now seen corresponding path program 1 times [2018-11-06 19:50:25,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:25,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:25,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 19:50:26,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:26,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:50:26,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:26,135 INFO L87 Difference]: Start difference. First operand 5476 states and 7066 transitions. Second operand 4 states. [2018-11-06 19:50:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:29,355 INFO L93 Difference]: Finished difference Result 11752 states and 15226 transitions. [2018-11-06 19:50:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:29,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-11-06 19:50:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:29,381 INFO L225 Difference]: With dead ends: 11752 [2018-11-06 19:50:29,382 INFO L226 Difference]: Without dead ends: 6278 [2018-11-06 19:50:29,388 INFO L604 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 [2018-11-06 19:50:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2018-11-06 19:50:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 6278. [2018-11-06 19:50:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6278 states. [2018-11-06 19:50:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 7663 transitions. [2018-11-06 19:50:29,481 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 7663 transitions. Word has length 214 [2018-11-06 19:50:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:29,481 INFO L480 AbstractCegarLoop]: Abstraction has 6278 states and 7663 transitions. [2018-11-06 19:50:29,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 7663 transitions. [2018-11-06 19:50:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-06 19:50:29,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:29,492 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:29,493 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:29,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash 786425851, now seen corresponding path program 1 times [2018-11-06 19:50:29,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:29,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:29,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:29,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:29,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-06 19:50:29,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:29,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:50:29,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:29,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:29,805 INFO L87 Difference]: Start difference. First operand 6278 states and 7663 transitions. Second operand 4 states. [2018-11-06 19:50:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:31,284 INFO L93 Difference]: Finished difference Result 17570 states and 21355 transitions. [2018-11-06 19:50:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:31,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-11-06 19:50:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:31,305 INFO L225 Difference]: With dead ends: 17570 [2018-11-06 19:50:31,305 INFO L226 Difference]: Without dead ends: 11294 [2018-11-06 19:50:31,313 INFO L604 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 [2018-11-06 19:50:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11294 states. [2018-11-06 19:50:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11294 to 11294. [2018-11-06 19:50:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11294 states. [2018-11-06 19:50:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11294 states to 11294 states and 13397 transitions. [2018-11-06 19:50:31,450 INFO L78 Accepts]: Start accepts. Automaton has 11294 states and 13397 transitions. Word has length 240 [2018-11-06 19:50:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:31,450 INFO L480 AbstractCegarLoop]: Abstraction has 11294 states and 13397 transitions. [2018-11-06 19:50:31,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 11294 states and 13397 transitions. [2018-11-06 19:50:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-06 19:50:31,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:31,464 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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] [2018-11-06 19:50:31,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:31,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1925839948, now seen corresponding path program 1 times [2018-11-06 19:50:31,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:31,846 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:50:32,125 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:50:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-06 19:50:32,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:32,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:50:32,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:50:32,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:50:32,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:50:32,268 INFO L87 Difference]: Start difference. First operand 11294 states and 13397 transitions. Second operand 6 states. [2018-11-06 19:50:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:34,383 INFO L93 Difference]: Finished difference Result 22046 states and 26069 transitions. [2018-11-06 19:50:34,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:50:34,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2018-11-06 19:50:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:34,403 INFO L225 Difference]: With dead ends: 22046 [2018-11-06 19:50:34,403 INFO L226 Difference]: Without dead ends: 10886 [2018-11-06 19:50:34,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:50:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2018-11-06 19:50:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 10230. [2018-11-06 19:50:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10230 states. [2018-11-06 19:50:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10230 states to 10230 states and 11627 transitions. [2018-11-06 19:50:34,548 INFO L78 Accepts]: Start accepts. Automaton has 10230 states and 11627 transitions. Word has length 262 [2018-11-06 19:50:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:34,548 INFO L480 AbstractCegarLoop]: Abstraction has 10230 states and 11627 transitions. [2018-11-06 19:50:34,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:50:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 10230 states and 11627 transitions. [2018-11-06 19:50:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-06 19:50:34,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:34,564 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:34,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:34,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash 540650741, now seen corresponding path program 1 times [2018-11-06 19:50:34,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:34,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:34,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:34,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:35,451 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-06 19:50:35,659 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-11-06 19:50:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 364 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-06 19:50:36,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:50:36,047 INFO L225 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 [2018-11-06 19:50:36,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:36,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:50:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-06 19:50:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:50:36,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 19:50:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:50:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:50:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:50:36,410 INFO L87 Difference]: Start difference. First operand 10230 states and 11627 transitions. Second operand 14 states. [2018-11-06 19:50:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:38,834 INFO L93 Difference]: Finished difference Result 16251 states and 18322 transitions. [2018-11-06 19:50:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:50:38,834 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 284 [2018-11-06 19:50:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:38,835 INFO L225 Difference]: With dead ends: 16251 [2018-11-06 19:50:38,835 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:50:38,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:50:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:50:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:50:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:50:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:50:38,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2018-11-06 19:50:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:38,846 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:50:38,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:50:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:50:38,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:50:38,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:50:38,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:38,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,002 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 113 [2018-11-06 19:50:39,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:50:39,151 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 113 [2018-11-06 19:50:41,530 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2018-11-06 19:50:41,828 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,831 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:50:41,832 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:50:41,833 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:50:41,834 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,835 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:50:41,836 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:50:41,837 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a17~0 1)) (.cse13 (= ~a16~0 6)) (.cse9 (= ~a7~0 1)) (.cse11 (= ~a8~0 13))) (let ((.cse5 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse10 (<= ~a21~0 0)) (.cse6 (<= ~a17~0 0)) (.cse4 (= ~a20~0 1)) (.cse8 (not .cse9)) (.cse0 (not .cse13)) (.cse1 (= ~a12~0 8)) (.cse3 (= ~a21~0 1)) (.cse12 (not .cse2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (and .cse5 .cse6 .cse3 .cse7)) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse8 (= ~a8~0 15) .cse1 .cse3) (and .cse9 .cse10 .cse0 .cse11 .cse2 .cse1) (and .cse9 .cse10 .cse5 .cse11 .cse1 .cse6) (and .cse1 .cse3 .cse12 .cse7 (= ~a16~0 5)) (and .cse9 .cse10 .cse11 .cse1 .cse6 .cse4 .cse13 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse8 .cse0 .cse1 .cse3 .cse12)))) [2018-11-06 19:50:41,837 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,837 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,837 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,837 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:50:41,838 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:50:41,839 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:50:41,840 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,841 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:50:41,842 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:50:41,843 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:50:41,844 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:50:41,844 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,844 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,844 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,844 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a17~0 1)) (.cse13 (= ~a16~0 6)) (.cse9 (= ~a7~0 1)) (.cse11 (= ~a8~0 13))) (let ((.cse5 (= ~a16~0 4)) (.cse7 (not .cse11)) (.cse10 (<= ~a21~0 0)) (.cse6 (<= ~a17~0 0)) (.cse4 (= ~a20~0 1)) (.cse8 (not .cse9)) (.cse0 (not .cse13)) (.cse1 (= ~a12~0 8)) (.cse3 (= ~a21~0 1)) (.cse12 (not .cse2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (and .cse5 .cse6 .cse3 .cse7)) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse8 (= ~a8~0 15) .cse1 .cse3) (and .cse9 .cse10 .cse0 .cse11 .cse2 .cse1) (and .cse9 .cse10 .cse5 .cse11 .cse1 .cse6) (and .cse1 .cse3 .cse12 .cse7 (= ~a16~0 5)) (and .cse9 .cse10 .cse11 .cse1 .cse6 .cse4 .cse13 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and .cse8 .cse0 .cse1 .cse3 .cse12)))) [2018-11-06 19:50:41,844 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:50:41,845 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:50:41,846 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:50:41,847 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:50:41,848 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:50:41,849 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,850 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:50:41,851 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:50:41,852 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:50:41,853 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:50:41,854 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:50:41,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:50:41 BoogieIcfgContainer [2018-11-06 19:50:41,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:50:41,879 INFO L168 Benchmark]: Toolchain (without parser) took 35763.97 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 188.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:41,881 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:50:41,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:41,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:41,883 INFO L168 Benchmark]: Boogie Preprocessor took 80.32 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:50:41,884 INFO L168 Benchmark]: RCFGBuilder took 3530.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:41,884 INFO L168 Benchmark]: TraceAbstraction took 31234.88 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 475.0 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -362.5 MB). Peak memory consumption was 112.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:50:41,890 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 177.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.32 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3530.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31234.88 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 475.0 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -362.5 MB). Peak memory consumption was 112.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1) || (a12 == 8 && ((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || ((((a12 == 8 && a21 == 1) && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((!(a16 == 6) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1) || (a12 == 8 && ((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((((!(a7 == 1) && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1)) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || ((((a12 == 8 && a21 == 1) && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((!(a7 == 1) && !(a16 == 6)) && a12 == 8) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 31.1s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1743 SDtfs, 3771 SDslu, 826 SDs, 0 SdLazy, 8049 SolverSat, 1691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 298 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11294occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 732 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 100 NumberOfFragments, 363 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5301 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1032 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2268 NumberOfCodeBlocks, 2268 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1647835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2856/2866 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...