java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label03_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:48:53,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:48:53,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:48:53,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:48:53,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:48:53,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:48:53,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:48:53,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:48:53,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:48:53,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:48:53,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:48:53,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:48:53,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:48:53,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:48:53,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:48:53,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:48:53,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:48:53,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:48:53,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:48:53,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:48:53,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:48:53,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:48:53,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:48:53,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:48:53,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:48:53,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:48:53,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:48:53,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:48:53,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:48:53,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:48:53,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:48:53,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:48:53,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:48:53,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:48:53,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:48:53,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:48:53,072 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:48:53,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:48:53,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:48:53,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:48:53,099 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:48:53,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:48:53,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:48:53,100 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:48:53,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:48:53,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:48:53,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:48:53,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:48:53,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:48:53,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:48:53,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:48:53,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:48:53,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:48:53,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:48:53,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:48:53,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:48:53,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:48:53,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:48:53,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:48:53,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:48:53,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:48:53,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:48:53,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:48:53,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:48:53,106 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:48:53,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:48:53,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:48:53,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:48:53,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:48:53,181 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:48:53,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label03_true-unreach-call_false-termination.c [2018-10-24 14:48:53,247 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb5cd4c94/00e479108fa4407e87520dd77e7097b4/FLAGa818dcffb [2018-10-24 14:48:53,827 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:48:53,828 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label03_true-unreach-call_false-termination.c [2018-10-24 14:48:53,849 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb5cd4c94/00e479108fa4407e87520dd77e7097b4/FLAGa818dcffb [2018-10-24 14:48:53,874 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb5cd4c94/00e479108fa4407e87520dd77e7097b4 [2018-10-24 14:48:53,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:48:53,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:48:53,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:48:53,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:48:53,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:48:53,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:48:53" (1/1) ... [2018-10-24 14:48:53,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:53, skipping insertion in model container [2018-10-24 14:48:53,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:48:53" (1/1) ... [2018-10-24 14:48:53,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:48:53,980 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:48:54,429 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:48:54,437 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:48:54,576 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:48:54,596 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:48:54,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54 WrapperNode [2018-10-24 14:48:54,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:48:54,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:48:54,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:48:54,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:48:54,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:48:54,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:48:54,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:48:54,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:48:54,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... [2018-10-24 14:48:54,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:48:54,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:48:54,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:48:54,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:48:54,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:48:55,007 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:48:55,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:48:55,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:48:58,219 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:48:58,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:58 BoogieIcfgContainer [2018-10-24 14:48:58,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:48:58,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:48:58,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:48:58,225 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:48:58,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:48:53" (1/3) ... [2018-10-24 14:48:58,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e8ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:48:58, skipping insertion in model container [2018-10-24 14:48:58,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:54" (2/3) ... [2018-10-24 14:48:58,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e8ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:48:58, skipping insertion in model container [2018-10-24 14:48:58,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:58" (3/3) ... [2018-10-24 14:48:58,229 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label03_true-unreach-call_false-termination.c [2018-10-24 14:48:58,240 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:48:58,251 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:48:58,273 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:48:58,315 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:48:58,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:48:58,317 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:48:58,317 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:48:58,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:48:58,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:48:58,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:48:58,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:48:58,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:48:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:48:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-24 14:48:58,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:48:58,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:48:58,369 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:48:58,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:48:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 979584151, now seen corresponding path program 1 times [2018-10-24 14:48:58,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:48:58,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:48:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:48:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:48:59,236 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-24 14:48:59,431 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-24 14:48:59,686 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-10-24 14:49:00,040 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-24 14:49:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:49:00,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:00,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-24 14:49:00,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 14:49:00,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 14:49:00,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:49:00,398 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 10 states. [2018-10-24 14:49:00,771 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 14:49:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:02,990 INFO L93 Difference]: Finished difference Result 636 states and 1117 transitions. [2018-10-24 14:49:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:49:02,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2018-10-24 14:49:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:03,009 INFO L225 Difference]: With dead ends: 636 [2018-10-24 14:49:03,009 INFO L226 Difference]: Without dead ends: 254 [2018-10-24 14:49:03,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-24 14:49:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-24 14:49:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-10-24 14:49:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-24 14:49:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2018-10-24 14:49:03,071 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 130 [2018-10-24 14:49:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:03,072 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2018-10-24 14:49:03,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 14:49:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2018-10-24 14:49:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-24 14:49:03,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:03,076 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:03,077 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:03,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1016784367, now seen corresponding path program 1 times [2018-10-24 14:49:03,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:03,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:49:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:03,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:03,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:03,307 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 3 states. [2018-10-24 14:49:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:04,681 INFO L93 Difference]: Finished difference Result 579 states and 960 transitions. [2018-10-24 14:49:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:04,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-10-24 14:49:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:04,687 INFO L225 Difference]: With dead ends: 579 [2018-10-24 14:49:04,687 INFO L226 Difference]: Without dead ends: 386 [2018-10-24 14:49:04,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-24 14:49:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-10-24 14:49:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-24 14:49:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 589 transitions. [2018-10-24 14:49:04,716 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 589 transitions. Word has length 135 [2018-10-24 14:49:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:04,717 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 589 transitions. [2018-10-24 14:49:04,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 589 transitions. [2018-10-24 14:49:04,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 14:49:04,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:04,721 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:04,722 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:04,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1403687723, now seen corresponding path program 1 times [2018-10-24 14:49:04,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:04,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:49:05,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:05,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:05,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:05,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:05,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:05,107 INFO L87 Difference]: Start difference. First operand 386 states and 589 transitions. Second operand 4 states. [2018-10-24 14:49:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:06,778 INFO L93 Difference]: Finished difference Result 1107 states and 1833 transitions. [2018-10-24 14:49:06,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:06,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-10-24 14:49:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:06,784 INFO L225 Difference]: With dead ends: 1107 [2018-10-24 14:49:06,785 INFO L226 Difference]: Without dead ends: 649 [2018-10-24 14:49:06,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-10-24 14:49:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2018-10-24 14:49:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-10-24 14:49:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 835 transitions. [2018-10-24 14:49:06,828 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 835 transitions. Word has length 138 [2018-10-24 14:49:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:06,829 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 835 transitions. [2018-10-24 14:49:06,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 835 transitions. [2018-10-24 14:49:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-24 14:49:06,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:06,834 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:49:06,834 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:06,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash -412926919, now seen corresponding path program 1 times [2018-10-24 14:49:06,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:06,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 14:49:06,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:06,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:06,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:06,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:06,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:06,998 INFO L87 Difference]: Start difference. First operand 649 states and 835 transitions. Second operand 3 states. [2018-10-24 14:49:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:09,591 INFO L93 Difference]: Finished difference Result 1501 states and 2029 transitions. [2018-10-24 14:49:09,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:09,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-24 14:49:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:09,598 INFO L225 Difference]: With dead ends: 1501 [2018-10-24 14:49:09,599 INFO L226 Difference]: Without dead ends: 913 [2018-10-24 14:49:09,600 INFO L605 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-10-24 14:49:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-24 14:49:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2018-10-24 14:49:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-10-24 14:49:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1165 transitions. [2018-10-24 14:49:09,621 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1165 transitions. Word has length 147 [2018-10-24 14:49:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:09,622 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1165 transitions. [2018-10-24 14:49:09,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1165 transitions. [2018-10-24 14:49:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-24 14:49:09,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:09,625 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:09,625 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:09,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash 423618088, now seen corresponding path program 1 times [2018-10-24 14:49:09,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:09,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 14:49:09,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:09,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:09,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:09,747 INFO L87 Difference]: Start difference. First operand 913 states and 1165 transitions. Second operand 4 states. [2018-10-24 14:49:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:11,247 INFO L93 Difference]: Finished difference Result 3349 states and 4353 transitions. [2018-10-24 14:49:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:11,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-10-24 14:49:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:11,260 INFO L225 Difference]: With dead ends: 3349 [2018-10-24 14:49:11,260 INFO L226 Difference]: Without dead ends: 2497 [2018-10-24 14:49:11,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2018-10-24 14:49:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2497. [2018-10-24 14:49:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2497 states. [2018-10-24 14:49:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 3065 transitions. [2018-10-24 14:49:11,306 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 3065 transitions. Word has length 157 [2018-10-24 14:49:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:11,306 INFO L481 AbstractCegarLoop]: Abstraction has 2497 states and 3065 transitions. [2018-10-24 14:49:11,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 3065 transitions. [2018-10-24 14:49:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-24 14:49:11,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:11,312 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:11,312 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:11,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -553721287, now seen corresponding path program 1 times [2018-10-24 14:49:11,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:11,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:11,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 14:49:11,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:11,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:11,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:11,423 INFO L87 Difference]: Start difference. First operand 2497 states and 3065 transitions. Second operand 4 states. [2018-10-24 14:49:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:12,414 INFO L93 Difference]: Finished difference Result 5197 states and 6462 transitions. [2018-10-24 14:49:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:12,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-10-24 14:49:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:12,430 INFO L225 Difference]: With dead ends: 5197 [2018-10-24 14:49:12,431 INFO L226 Difference]: Without dead ends: 2761 [2018-10-24 14:49:12,435 INFO L605 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-10-24 14:49:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2018-10-24 14:49:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2761. [2018-10-24 14:49:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-10-24 14:49:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3397 transitions. [2018-10-24 14:49:12,493 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3397 transitions. Word has length 163 [2018-10-24 14:49:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:12,494 INFO L481 AbstractCegarLoop]: Abstraction has 2761 states and 3397 transitions. [2018-10-24 14:49:12,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3397 transitions. [2018-10-24 14:49:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:49:12,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:12,502 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:49:12,502 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:12,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 491398526, now seen corresponding path program 1 times [2018-10-24 14:49:12,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:12,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:49:12,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:12,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:12,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:12,748 INFO L87 Difference]: Start difference. First operand 2761 states and 3397 transitions. Second operand 3 states. [2018-10-24 14:49:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:14,095 INFO L93 Difference]: Finished difference Result 6253 states and 7880 transitions. [2018-10-24 14:49:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:14,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-24 14:49:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:14,111 INFO L225 Difference]: With dead ends: 6253 [2018-10-24 14:49:14,112 INFO L226 Difference]: Without dead ends: 3553 [2018-10-24 14:49:14,116 INFO L605 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-10-24 14:49:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2018-10-24 14:49:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3553. [2018-10-24 14:49:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3553 states. [2018-10-24 14:49:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4318 transitions. [2018-10-24 14:49:14,172 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4318 transitions. Word has length 197 [2018-10-24 14:49:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:14,173 INFO L481 AbstractCegarLoop]: Abstraction has 3553 states and 4318 transitions. [2018-10-24 14:49:14,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4318 transitions. [2018-10-24 14:49:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-24 14:49:14,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:14,181 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:49:14,181 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:14,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash -690540703, now seen corresponding path program 1 times [2018-10-24 14:49:14,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:14,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:14,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:14,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-24 14:49:14,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:49:14,466 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:49:14,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:14,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:49:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:49:14,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:49:14,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:49:14,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:49:14,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:49:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:49:14,697 INFO L87 Difference]: Start difference. First operand 3553 states and 4318 transitions. Second operand 8 states. [2018-10-24 14:49:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:20,069 INFO L93 Difference]: Finished difference Result 8801 states and 10926 transitions. [2018-10-24 14:49:20,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:49:20,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-10-24 14:49:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:20,094 INFO L225 Difference]: With dead ends: 8801 [2018-10-24 14:49:20,095 INFO L226 Difference]: Without dead ends: 5040 [2018-10-24 14:49:20,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:49:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2018-10-24 14:49:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4755. [2018-10-24 14:49:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4755 states. [2018-10-24 14:49:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 5617 transitions. [2018-10-24 14:49:20,189 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 5617 transitions. Word has length 227 [2018-10-24 14:49:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:20,189 INFO L481 AbstractCegarLoop]: Abstraction has 4755 states and 5617 transitions. [2018-10-24 14:49:20,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:49:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 5617 transitions. [2018-10-24 14:49:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-24 14:49:20,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:20,199 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:20,199 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:20,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2094505690, now seen corresponding path program 1 times [2018-10-24 14:49:20,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:20,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:20,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-24 14:49:20,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:20,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:20,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:20,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:20,486 INFO L87 Difference]: Start difference. First operand 4755 states and 5617 transitions. Second operand 4 states. [2018-10-24 14:49:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:21,651 INFO L93 Difference]: Finished difference Result 9449 states and 11171 transitions. [2018-10-24 14:49:21,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:21,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-10-24 14:49:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:21,665 INFO L225 Difference]: With dead ends: 9449 [2018-10-24 14:49:21,665 INFO L226 Difference]: Without dead ends: 4755 [2018-10-24 14:49:21,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-24 14:49:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2018-10-24 14:49:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4755. [2018-10-24 14:49:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4755 states. [2018-10-24 14:49:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 5402 transitions. [2018-10-24 14:49:21,737 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 5402 transitions. Word has length 257 [2018-10-24 14:49:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:21,737 INFO L481 AbstractCegarLoop]: Abstraction has 4755 states and 5402 transitions. [2018-10-24 14:49:21,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 5402 transitions. [2018-10-24 14:49:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 14:49:21,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:21,747 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:49:21,748 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:21,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash -275436835, now seen corresponding path program 1 times [2018-10-24 14:49:21,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:21,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:21,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:22,222 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 14:49:22,476 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-24 14:49:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-10-24 14:49:22,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:22,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:49:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:49:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:49:22,609 INFO L87 Difference]: Start difference. First operand 4755 states and 5402 transitions. Second operand 5 states. [2018-10-24 14:49:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:23,660 INFO L93 Difference]: Finished difference Result 9714 states and 11038 transitions. [2018-10-24 14:49:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:49:23,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2018-10-24 14:49:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:23,680 INFO L225 Difference]: With dead ends: 9714 [2018-10-24 14:49:23,680 INFO L226 Difference]: Without dead ends: 4754 [2018-10-24 14:49:23,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:49:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2018-10-24 14:49:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2018-10-24 14:49:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4754 states. [2018-10-24 14:49:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 5391 transitions. [2018-10-24 14:49:23,748 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 5391 transitions. Word has length 279 [2018-10-24 14:49:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:23,748 INFO L481 AbstractCegarLoop]: Abstraction has 4754 states and 5391 transitions. [2018-10-24 14:49:23,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:49:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 5391 transitions. [2018-10-24 14:49:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-24 14:49:23,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:23,759 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:23,759 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:23,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:23,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1779979943, now seen corresponding path program 1 times [2018-10-24 14:49:23,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:23,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:23,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:23,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:23,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:24,362 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-24 14:49:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-24 14:49:25,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:49:25,021 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:49:25,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:25,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:49:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 14:49:25,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:49:25,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 14:49:25,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 14:49:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 14:49:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:49:25,305 INFO L87 Difference]: Start difference. First operand 4754 states and 5391 transitions. Second operand 14 states. [2018-10-24 14:49:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:27,575 INFO L93 Difference]: Finished difference Result 7358 states and 8329 transitions. [2018-10-24 14:49:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:49:27,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 286 [2018-10-24 14:49:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:27,576 INFO L225 Difference]: With dead ends: 7358 [2018-10-24 14:49:27,576 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:49:27,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-10-24 14:49:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:49:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:49:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:49:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:49:27,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 286 [2018-10-24 14:49:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:27,582 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:49:27,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 14:49:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:49:27,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:49:27,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:49:28,088 WARN L179 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-10-24 14:49:28,403 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-10-24 14:49:28,407 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:49:28,407 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:49:28,407 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2018-10-24 14:49:28,407 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,407 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,407 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:49:28,408 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,409 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:49:28,410 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:49:28,411 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:49:28,412 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:49:28,413 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:49:28,413 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:49:28,413 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:49:28,413 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 6)) (.cse0 (not .cse5)) (.cse9 (= ~a16~0 4)) (.cse6 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse10 (= ~a17~0 1)) (.cse8 (= ~a20~0 1)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a21~0 1)) (.cse4 (<= ~a20~0 0)) (.cse11 (= ~a16~0 5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse1 .cse8 .cse3) (and .cse9 .cse1 .cse2 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse8) (and .cse6 (not (= 6 ~a16~0)) .cse10 .cse1 .cse4) (and (= ~a8~0 14) .cse1 .cse2 .cse8 (not .cse10) .cse11) (and .cse0 .cse1 .cse2 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse8 .cse11) (and .cse9 .cse10 .cse1 .cse2) (and .cse5 .cse6 .cse9 .cse7 .cse1 (<= ~a17~0 0) .cse8 (= ULTIMATE.start_calculate_output_~input 4)) (and (= ~a8~0 15) .cse10 .cse1 .cse2 .cse8 .cse11) (and .cse5 .cse6 .cse7 .cse1 .cse10 .cse8) (and .cse1 .cse2 .cse4 .cse11)))) [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:49:28,414 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:49:28,415 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,416 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,417 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:49:28,418 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:49:28,419 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:49:28,420 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:49:28,420 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,420 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,420 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,420 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1))) (let ((.cse3 (= ~a16~0 6)) (.cse0 (not .cse5)) (.cse9 (= ~a16~0 4)) (.cse6 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse10 (= ~a17~0 1)) (.cse8 (= ~a20~0 1)) (.cse1 (= ~a12~0 8)) (.cse2 (= ~a21~0 1)) (.cse4 (<= ~a20~0 0)) (.cse11 (= ~a16~0 5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse1 .cse8 .cse3) (and .cse9 .cse1 .cse2 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse8) (and .cse6 (not (= 6 ~a16~0)) .cse10 .cse1 .cse4) (and (= ~a8~0 14) .cse1 .cse2 .cse8 (not .cse10) .cse11) (and .cse0 .cse1 .cse2 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse8 .cse11) (and .cse9 .cse10 .cse1 .cse2) (and .cse5 .cse6 .cse9 .cse7 .cse1 (<= ~a17~0 0) .cse8 (= ULTIMATE.start_calculate_output_~input 4)) (and (= ~a8~0 15) .cse10 .cse1 .cse2 .cse8 .cse11) (and .cse5 .cse6 .cse7 .cse1 .cse10 .cse8) (and .cse1 .cse2 .cse4 .cse11)))) [2018-10-24 14:49:28,420 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,420 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:49:28,421 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:49:28,422 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:49:28,423 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:49:28,424 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:49:28,425 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:49:28,426 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:49:28,427 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:49:28,428 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:49:28,429 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:49:28,429 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:49:28,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:49:28 BoogieIcfgContainer [2018-10-24 14:49:28,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:49:28,469 INFO L168 Benchmark]: Toolchain (without parser) took 34580.99 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -699.7 MB). Peak memory consumption was 440.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:28,470 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:49:28,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:28,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 236.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 690.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -774.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:28,472 INFO L168 Benchmark]: Boogie Preprocessor took 97.60 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:49:28,473 INFO L168 Benchmark]: RCFGBuilder took 3287.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 122.9 MB). Peak memory consumption was 122.9 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:28,474 INFO L168 Benchmark]: TraceAbstraction took 30245.40 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 449.8 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -90.5 MB). Peak memory consumption was 359.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:28,480 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 236.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 690.5 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -774.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.60 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3287.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 122.9 MB). Peak memory consumption was 122.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30245.40 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 449.8 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -90.5 MB). Peak memory consumption was 359.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: (((((((((((((((!(a7 == 1) && a12 == 8) && a21 == 1) && a16 == 6) && a20 <= 0) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a20 == 1) && a16 == 6)) || (((a16 == 4 && a12 == 8) && a21 == 1) && a20 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((a21 <= 0 && !(6 == a16)) && a17 == 1) && a12 == 8) && a20 <= 0)) || (((((a8 == 14 && a12 == 8) && a21 == 1) && a20 == 1) && !(a17 == 1)) && a16 == 5)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 5)) || (((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && input == 4)) || (((((a8 == 15 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 5)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && a20 <= 0) && a16 == 5) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((!(a7 == 1) && a12 == 8) && a21 == 1) && a16 == 6) && a20 <= 0) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a20 == 1) && a16 == 6)) || (((a16 == 4 && a12 == 8) && a21 == 1) && a20 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a12 == 8) && a21 == 1) && a20 == 1)) || ((((a21 <= 0 && !(6 == a16)) && a17 == 1) && a12 == 8) && a20 <= 0)) || (((((a8 == 14 && a12 == 8) && a21 == 1) && a20 == 1) && !(a17 == 1)) && a16 == 5)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 5)) || (((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && input == 4)) || (((((a8 == 15 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 5)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 == 1) && a20 == 1)) || (((a12 == 8 && a21 == 1) && a20 <= 0) && a16 == 5) - 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, 30.1s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 22.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1567 SDtfs, 4909 SDslu, 984 SDs, 0 SdLazy, 9313 SolverSat, 1922 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 531 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4755occurred in iteration=8, 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.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 285 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 62 NumberOfFragments, 455 HoareAnnotationTreeSize, 3 FomulaSimplifications, 775 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 244 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2616 ConstructedInterpolants, 0 QuantifiedInterpolants, 2943925 SizeOfPredicates, 2 NumberOfNonLiveVariables, 894 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1778/1810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...