java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:51:20,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:51:20,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:51:20,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:51:20,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:51:20,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:51:20,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:51:20,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:51:20,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:51:20,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:51:20,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:51:20,903 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:51:20,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:51:20,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:51:20,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:51:20,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:51:20,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:51:20,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:51:20,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:51:20,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:51:20,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:51:20,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:51:20,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:51:20,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:51:20,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:51:20,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:51:20,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:51:20,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:51:20,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:51:20,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:51:20,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:51:20,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:51:20,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:51:20,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:51:20,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:51:20,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:51:20,930 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:51:20,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:51:20,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:51:20,946 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:51:20,947 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:51:20,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:51:20,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:51:20,948 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:51:20,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:51:20,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:51:20,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:51:20,949 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:51:20,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:51:20,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:51:20,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:51:20,950 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:51:20,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:51:20,950 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:51:20,950 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:51:20,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:51:20,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:51:20,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:51:20,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:51:20,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:51:20,951 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:51:20,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:51:20,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:51:20,952 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:51:20,952 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:51:21,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:51:21,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:51:21,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:51:21,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:51:21,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:51:21,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-11-06 19:51:21,098 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a193ba41/c32f709e62774fdda47edf44788bb4e2/FLAGf74bf713f [2018-11-06 19:51:21,677 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:51:21,678 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-11-06 19:51:21,699 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a193ba41/c32f709e62774fdda47edf44788bb4e2/FLAGf74bf713f [2018-11-06 19:51:21,722 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a193ba41/c32f709e62774fdda47edf44788bb4e2 [2018-11-06 19:51:21,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:51:21,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:51:21,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:51:21,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:51:21,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:51:21,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:21" (1/1) ... [2018-11-06 19:51:21,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301511e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:21, skipping insertion in model container [2018-11-06 19:51:21,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:21" (1/1) ... [2018-11-06 19:51:21,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:51:21,837 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:51:22,341 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:51:22,348 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:51:22,458 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:51:22,475 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:51:22,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22 WrapperNode [2018-11-06 19:51:22,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:51:22,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:51:22,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:51:22,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:51:22,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:51:22,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:51:22,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:51:22,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:51:22,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... [2018-11-06 19:51:22,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:51:22,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:51:22,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:51:22,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:51:22,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:51:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:51:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:51:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:51:25,985 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:51:25,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:25 BoogieIcfgContainer [2018-11-06 19:51:25,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:51:25,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:51:25,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:51:25,992 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:51:25,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:51:21" (1/3) ... [2018-11-06 19:51:25,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f62f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:25, skipping insertion in model container [2018-11-06 19:51:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:22" (2/3) ... [2018-11-06 19:51:25,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f62f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:25, skipping insertion in model container [2018-11-06 19:51:25,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:25" (3/3) ... [2018-11-06 19:51:25,997 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2018-11-06 19:51:26,009 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:51:26,020 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:51:26,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:51:26,091 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:51:26,092 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:51:26,092 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:51:26,092 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:51:26,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:51:26,093 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:51:26,093 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:51:26,093 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:51:26,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:51:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2018-11-06 19:51:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-06 19:51:26,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:26,150 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] [2018-11-06 19:51:26,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:26,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1193554477, now seen corresponding path program 1 times [2018-11-06 19:51:26,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:26,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:26,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:26,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:26,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:26,845 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 4 states. [2018-11-06 19:51:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:29,463 INFO L93 Difference]: Finished difference Result 750 states and 1326 transitions. [2018-11-06 19:51:29,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:29,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-11-06 19:51:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:29,487 INFO L225 Difference]: With dead ends: 750 [2018-11-06 19:51:29,488 INFO L226 Difference]: Without dead ends: 515 [2018-11-06 19:51:29,493 INFO L604 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-11-06 19:51:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-06 19:51:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2018-11-06 19:51:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-11-06 19:51:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 794 transitions. [2018-11-06 19:51:29,572 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 794 transitions. Word has length 115 [2018-11-06 19:51:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:29,573 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 794 transitions. [2018-11-06 19:51:29,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 794 transitions. [2018-11-06 19:51:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-06 19:51:29,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:29,582 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:51:29,582 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:29,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash 364309998, now seen corresponding path program 1 times [2018-11-06 19:51:29,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:29,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:29,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:29,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:29,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:29,763 INFO L87 Difference]: Start difference. First operand 512 states and 794 transitions. Second operand 3 states. [2018-11-06 19:51:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:30,863 INFO L93 Difference]: Finished difference Result 1167 states and 1842 transitions. [2018-11-06 19:51:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:30,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-06 19:51:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:30,869 INFO L225 Difference]: With dead ends: 1167 [2018-11-06 19:51:30,869 INFO L226 Difference]: Without dead ends: 657 [2018-11-06 19:51:30,872 INFO L604 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-11-06 19:51:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-06 19:51:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 656. [2018-11-06 19:51:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-06 19:51:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 965 transitions. [2018-11-06 19:51:30,922 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 965 transitions. Word has length 126 [2018-11-06 19:51:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:30,922 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 965 transitions. [2018-11-06 19:51:30,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 965 transitions. [2018-11-06 19:51:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-06 19:51:30,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:30,934 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:30,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:30,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash -83751644, now seen corresponding path program 1 times [2018-11-06 19:51:30,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:30,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:30,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:30,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:31,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:31,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:31,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:31,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:31,056 INFO L87 Difference]: Start difference. First operand 656 states and 965 transitions. Second operand 3 states. [2018-11-06 19:51:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:33,090 INFO L93 Difference]: Finished difference Result 1453 states and 2182 transitions. [2018-11-06 19:51:33,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:33,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-11-06 19:51:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:33,095 INFO L225 Difference]: With dead ends: 1453 [2018-11-06 19:51:33,095 INFO L226 Difference]: Without dead ends: 799 [2018-11-06 19:51:33,097 INFO L604 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-11-06 19:51:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-11-06 19:51:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 798. [2018-11-06 19:51:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-06 19:51:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1123 transitions. [2018-11-06 19:51:33,136 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1123 transitions. Word has length 130 [2018-11-06 19:51:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:33,137 INFO L480 AbstractCegarLoop]: Abstraction has 798 states and 1123 transitions. [2018-11-06 19:51:33,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1123 transitions. [2018-11-06 19:51:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-06 19:51:33,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:33,149 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:33,149 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:33,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1881311475, now seen corresponding path program 1 times [2018-11-06 19:51:33,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:33,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:33,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-06 19:51:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:51:33,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:33,373 INFO L87 Difference]: Start difference. First operand 798 states and 1123 transitions. Second operand 3 states. [2018-11-06 19:51:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:34,959 INFO L93 Difference]: Finished difference Result 2301 states and 3267 transitions. [2018-11-06 19:51:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:34,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-06 19:51:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:34,968 INFO L225 Difference]: With dead ends: 2301 [2018-11-06 19:51:34,969 INFO L226 Difference]: Without dead ends: 1505 [2018-11-06 19:51:34,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-11-06 19:51:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2018-11-06 19:51:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2018-11-06 19:51:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2016 transitions. [2018-11-06 19:51:35,001 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2016 transitions. Word has length 138 [2018-11-06 19:51:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:35,002 INFO L480 AbstractCegarLoop]: Abstraction has 1505 states and 2016 transitions. [2018-11-06 19:51:35,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2016 transitions. [2018-11-06 19:51:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-06 19:51:35,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:35,006 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:35,006 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:35,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1017479274, now seen corresponding path program 1 times [2018-11-06 19:51:35,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:35,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:35,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:35,555 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-11-06 19:51:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:51:35,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:35,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-06 19:51:35,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:51:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:51:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:51:35,666 INFO L87 Difference]: Start difference. First operand 1505 states and 2016 transitions. Second operand 9 states. [2018-11-06 19:51:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:36,803 INFO L93 Difference]: Finished difference Result 3802 states and 5062 transitions. [2018-11-06 19:51:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:51:36,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2018-11-06 19:51:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:36,816 INFO L225 Difference]: With dead ends: 3802 [2018-11-06 19:51:36,816 INFO L226 Difference]: Without dead ends: 2299 [2018-11-06 19:51:36,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:51:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2018-11-06 19:51:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2290. [2018-11-06 19:51:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2018-11-06 19:51:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 2916 transitions. [2018-11-06 19:51:36,861 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 2916 transitions. Word has length 146 [2018-11-06 19:51:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:36,862 INFO L480 AbstractCegarLoop]: Abstraction has 2290 states and 2916 transitions. [2018-11-06 19:51:36,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:51:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 2916 transitions. [2018-11-06 19:51:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-06 19:51:36,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:36,868 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:36,869 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:36,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:36,869 INFO L82 PathProgramCache]: Analyzing trace with hash 308758605, now seen corresponding path program 1 times [2018-11-06 19:51:36,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:36,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:36,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:36,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:51:37,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:37,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:37,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:37,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:37,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:37,153 INFO L87 Difference]: Start difference. First operand 2290 states and 2916 transitions. Second operand 4 states. [2018-11-06 19:51:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:38,144 INFO L93 Difference]: Finished difference Result 5282 states and 6787 transitions. [2018-11-06 19:51:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:38,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-11-06 19:51:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:38,163 INFO L225 Difference]: With dead ends: 5282 [2018-11-06 19:51:38,163 INFO L226 Difference]: Without dead ends: 2412 [2018-11-06 19:51:38,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2018-11-06 19:51:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2410. [2018-11-06 19:51:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2018-11-06 19:51:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 2816 transitions. [2018-11-06 19:51:38,207 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 2816 transitions. Word has length 194 [2018-11-06 19:51:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:38,207 INFO L480 AbstractCegarLoop]: Abstraction has 2410 states and 2816 transitions. [2018-11-06 19:51:38,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2816 transitions. [2018-11-06 19:51:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-06 19:51:38,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:38,213 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:51:38,213 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:38,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1985513969, now seen corresponding path program 1 times [2018-11-06 19:51:38,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:38,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:38,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:38,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-06 19:51:38,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:38,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:38,381 INFO L87 Difference]: Start difference. First operand 2410 states and 2816 transitions. Second operand 3 states. [2018-11-06 19:51:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:40,022 INFO L93 Difference]: Finished difference Result 7073 states and 8283 transitions. [2018-11-06 19:51:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:40,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-11-06 19:51:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:40,036 INFO L225 Difference]: With dead ends: 7073 [2018-11-06 19:51:40,036 INFO L226 Difference]: Without dead ends: 2955 [2018-11-06 19:51:40,042 INFO L604 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-11-06 19:51:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2018-11-06 19:51:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2018-11-06 19:51:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2018-11-06 19:51:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3347 transitions. [2018-11-06 19:51:40,135 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3347 transitions. Word has length 194 [2018-11-06 19:51:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:40,136 INFO L480 AbstractCegarLoop]: Abstraction has 2955 states and 3347 transitions. [2018-11-06 19:51:40,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3347 transitions. [2018-11-06 19:51:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 19:51:40,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:40,144 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:40,144 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:40,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash -147645827, now seen corresponding path program 1 times [2018-11-06 19:51:40,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:40,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:40,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:40,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-06 19:51:40,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:40,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:51:40,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:40,320 INFO L87 Difference]: Start difference. First operand 2955 states and 3347 transitions. Second operand 3 states. [2018-11-06 19:51:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:41,599 INFO L93 Difference]: Finished difference Result 5906 states and 6690 transitions. [2018-11-06 19:51:41,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:41,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-06 19:51:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:41,611 INFO L225 Difference]: With dead ends: 5906 [2018-11-06 19:51:41,611 INFO L226 Difference]: Without dead ends: 2953 [2018-11-06 19:51:41,615 INFO L604 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-11-06 19:51:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2018-11-06 19:51:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2952. [2018-11-06 19:51:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-11-06 19:51:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3244 transitions. [2018-11-06 19:51:41,667 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3244 transitions. Word has length 261 [2018-11-06 19:51:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:41,667 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3244 transitions. [2018-11-06 19:51:41,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3244 transitions. [2018-11-06 19:51:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-06 19:51:41,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:41,676 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:41,676 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:41,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash -690086822, now seen corresponding path program 1 times [2018-11-06 19:51:41,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:41,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:41,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:41,940 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:51:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-06 19:51:42,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:42,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:42,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:42,064 INFO L87 Difference]: Start difference. First operand 2952 states and 3244 transitions. Second operand 4 states. [2018-11-06 19:51:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:45,353 INFO L93 Difference]: Finished difference Result 5613 states and 6163 transitions. [2018-11-06 19:51:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:51:45,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-11-06 19:51:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:45,363 INFO L225 Difference]: With dead ends: 5613 [2018-11-06 19:51:45,363 INFO L226 Difference]: Without dead ends: 2663 [2018-11-06 19:51:45,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2018-11-06 19:51:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2018-11-06 19:51:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2018-11-06 19:51:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 2840 transitions. [2018-11-06 19:51:45,405 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 2840 transitions. Word has length 263 [2018-11-06 19:51:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:45,406 INFO L480 AbstractCegarLoop]: Abstraction has 2662 states and 2840 transitions. [2018-11-06 19:51:45,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 2840 transitions. [2018-11-06 19:51:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-06 19:51:45,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:45,413 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:45,413 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:45,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash -132237431, now seen corresponding path program 1 times [2018-11-06 19:51:45,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:45,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:45,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:45,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:45,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-06 19:51:45,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:45,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:51:45,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:51:45,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:51:45,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:45,704 INFO L87 Difference]: Start difference. First operand 2662 states and 2840 transitions. Second operand 3 states. [2018-11-06 19:51:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:46,806 INFO L93 Difference]: Finished difference Result 5448 states and 5825 transitions. [2018-11-06 19:51:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:46,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2018-11-06 19:51:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:46,814 INFO L225 Difference]: With dead ends: 5448 [2018-11-06 19:51:46,815 INFO L226 Difference]: Without dead ends: 2216 [2018-11-06 19:51:46,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:51:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2018-11-06 19:51:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2074. [2018-11-06 19:51:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2018-11-06 19:51:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2192 transitions. [2018-11-06 19:51:46,847 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2192 transitions. Word has length 269 [2018-11-06 19:51:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:46,847 INFO L480 AbstractCegarLoop]: Abstraction has 2074 states and 2192 transitions. [2018-11-06 19:51:46,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:51:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2192 transitions. [2018-11-06 19:51:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-06 19:51:46,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:51:46,854 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:51:46,854 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:51:46,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:51:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1610941004, now seen corresponding path program 1 times [2018-11-06 19:51:46,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:51:46,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:51:46,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:46,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:51:46,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:51:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:51:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-06 19:51:47,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:51:47,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:51:47,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:51:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:51:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:51:47,043 INFO L87 Difference]: Start difference. First operand 2074 states and 2192 transitions. Second operand 4 states. [2018-11-06 19:51:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:51:47,562 INFO L93 Difference]: Finished difference Result 3716 states and 3937 transitions. [2018-11-06 19:51:47,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:51:47,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-11-06 19:51:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:51:47,563 INFO L225 Difference]: With dead ends: 3716 [2018-11-06 19:51:47,564 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:51:47,567 INFO L604 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-11-06 19:51:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:51:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:51:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:51:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:51:47,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 277 [2018-11-06 19:51:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:51:47,569 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:51:47,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:51:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:51:47,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:51:47,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:51:47,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:47,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:51:47,997 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-06 19:51:48,266 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-06 19:51:48,270 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,270 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,271 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,271 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-06 19:51:48,271 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-06 19:51:48,271 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,272 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,273 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,274 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-06 19:51:48,275 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-06 19:51:48,276 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-06 19:51:48,277 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-06 19:51:48,278 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-06 19:51:48,279 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-06 19:51:48,280 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:48,281 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-06 19:51:48,282 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-06 19:51:48,282 INFO L421 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~a11~0 1)) (.cse10 (= ~a25~0 1))) (let ((.cse0 (<= 10 ~a28~0)) (.cse1 (not .cse10)) (.cse8 (= ~a28~0 7)) (.cse11 (= ~a28~0 10)) (.cse4 (= ~a19~0 1)) (.cse6 (= ~a28~0 9)) (.cse9 (<= ~a19~0 0)) (.cse3 (= ~a17~0 8)) (.cse5 (not .cse2)) (.cse7 (not (= ~a28~0 11)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse4 .cse8 .cse2) (and .cse3 .cse4 (= ~a21~0 1) .cse7) (and .cse9 .cse0 .cse1 .cse3) (and (<= 11 ~a28~0) .cse4 .cse10) (and .cse3 .cse8 .cse2) (and .cse6 .cse3 .cse2) (and .cse11 .cse2) (and .cse11 .cse4) (and .cse6 .cse9) (and .cse9 .cse3 .cse5 .cse7)))) [2018-11-06 19:51:48,282 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-06 19:51:48,283 INFO L428 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2018-11-06 19:51:48,283 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-06 19:51:48,284 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-06 19:51:48,285 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~a11~0 1)) (.cse10 (= ~a25~0 1))) (let ((.cse0 (<= 10 ~a28~0)) (.cse1 (not .cse10)) (.cse8 (= ~a28~0 7)) (.cse11 (= ~a28~0 10)) (.cse4 (= ~a19~0 1)) (.cse6 (= ~a28~0 9)) (.cse9 (<= ~a19~0 0)) (.cse3 (= ~a17~0 8)) (.cse5 (not .cse2)) (.cse7 (not (= ~a28~0 11)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse4 .cse8 .cse2) (and .cse3 .cse4 (= ~a21~0 1) .cse7) (and .cse9 .cse0 .cse1 .cse3) (and (<= 11 ~a28~0) .cse4 .cse10) (and .cse3 .cse8 .cse2) (and .cse6 .cse3 .cse2) (and .cse11 .cse2) (and .cse11 .cse4) (and .cse6 .cse9) (and .cse9 .cse3 .cse5 .cse7)))) [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,286 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:48,287 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-06 19:51:48,288 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-06 19:51:48,289 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,290 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-06 19:51:48,291 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,292 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-06 19:51:48,293 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-06 19:51:48,294 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-06 19:51:48,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:51:48 BoogieIcfgContainer [2018-11-06 19:51:48,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:51:48,317 INFO L168 Benchmark]: Toolchain (without parser) took 26580.33 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 897.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:48,318 INFO L168 Benchmark]: CDTParser took 0.23 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-11-06 19:51:48,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.00 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:48,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 199.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -756.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:48,320 INFO L168 Benchmark]: Boogie Preprocessor took 60.91 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-11-06 19:51:48,321 INFO L168 Benchmark]: RCFGBuilder took 3248.72 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: 120.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:48,322 INFO L168 Benchmark]: TraceAbstraction took 22327.59 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 349.2 MB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -495.4 MB). Peak memory consumption was 809.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:48,327 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.23 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 735.00 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 199.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -756.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.91 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 3248.72 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: 120.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22327.59 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 349.2 MB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -495.4 MB). Peak memory consumption was 809.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 514]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((10 <= a28 && !(a25 == 1)) && a11 == 1) || ((((a17 == 8 && a19 == 1) && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 11))) || ((a19 == 1 && a28 == 7) && a11 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (((a19 <= 0 && 10 <= a28) && !(a25 == 1)) && a17 == 8)) || ((11 <= a28 && a19 == 1) && a25 == 1)) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((a28 == 9 && a17 == 8) && a11 == 1)) || (a28 == 10 && a11 == 1)) || (a28 == 10 && a19 == 1)) || (a28 == 9 && a19 <= 0)) || (((a19 <= 0 && a17 == 8) && !(a11 == 1)) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((10 <= a28 && !(a25 == 1)) && a11 == 1) || ((((a17 == 8 && a19 == 1) && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 11))) || ((a19 == 1 && a28 == 7) && a11 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (((a19 <= 0 && 10 <= a28) && !(a25 == 1)) && a17 == 8)) || ((11 <= a28 && a19 == 1) && a25 == 1)) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((a28 == 9 && a17 == 8) && a11 == 1)) || (a28 == 10 && a11 == 1)) || (a28 == 10 && a19 == 1)) || (a28 == 9 && a19 <= 0)) || (((a19 <= 0 && a17 == 8) && !(a11 == 1)) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. SAFE Result, 22.2s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 2025 SDtfs, 2882 SDslu, 601 SDs, 0 SdLazy, 5705 SolverSat, 1374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2955occurred in iteration=7, 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.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 160 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 70 NumberOfFragments, 271 HoareAnnotationTreeSize, 3 FomulaSimplifications, 976 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 132 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2113 NumberOfCodeBlocks, 2113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2102 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1436/1436 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...