java -Xss4m -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-71425fa [2018-07-22 06:01:51,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-22 06:01:51,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-22 06:01:51,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-22 06:01:51,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-22 06:01:51,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-22 06:01:51,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-22 06:01:51,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-22 06:01:51,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-22 06:01:51,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-22 06:01:51,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-22 06:01:51,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-22 06:01:51,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-22 06:01:51,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-22 06:01:51,799 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-22 06:01:51,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-22 06:01:51,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-22 06:01:51,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-22 06:01:51,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-22 06:01:51,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-22 06:01:51,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-22 06:01:51,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-22 06:01:51,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-22 06:01:51,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-22 06:01:51,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-22 06:01:51,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-22 06:01:51,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-22 06:01:51,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-22 06:01:51,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-22 06:01:51,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-22 06:01:51,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-22 06:01:51,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-22 06:01:51,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-22 06:01:51,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-22 06:01:51,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-22 06:01:51,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-22 06:01:51,837 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-22 06:01:51,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-22 06:01:51,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-22 06:01:51,862 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-22 06:01:51,862 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-22 06:01:51,863 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-22 06:01:51,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-22 06:01:51,863 INFO L133 SettingsManager]: * Use SBE=true [2018-07-22 06:01:51,864 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-22 06:01:51,865 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-22 06:01:51,865 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-22 06:01:51,865 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-22 06:01:51,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-22 06:01:51,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-22 06:01:51,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-22 06:01:51,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-22 06:01:51,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-22 06:01:51,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-22 06:01:51,866 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-22 06:01:51,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-22 06:01:51,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-22 06:01:51,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-22 06:01:51,867 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-07-22 06:01:51,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-22 06:01:51,868 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-22 06:01:51,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-22 06:01:51,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-22 06:01:51,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-22 06:01:51,869 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-22 06:01:51,870 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-22 06:01:51,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-22 06:01:51,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-22 06:01:51,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-22 06:01:51,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-22 06:01:51,950 INFO L276 PluginConnector]: CDTParser initialized [2018-07-22 06:01:51,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-07-22 06:01:52,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ada678/233d49c7d8f74864b263c57795240c8d/FLAGb345cb198 [2018-07-22 06:01:52,622 INFO L276 CDTParser]: Found 1 translation units. [2018-07-22 06:01:52,623 INFO L158 CDTParser]: Scanning /storage/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-07-22 06:01:52,640 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ada678/233d49c7d8f74864b263c57795240c8d/FLAGb345cb198 [2018-07-22 06:01:52,660 INFO L332 CDTParser]: Successfully deleted /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1ada678/233d49c7d8f74864b263c57795240c8d [2018-07-22 06:01:52,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-22 06:01:52,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-22 06:01:52,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-22 06:01:52,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-22 06:01:52,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-22 06:01:52,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 06:01:52" (1/1) ... [2018-07-22 06:01:52,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690e9663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:52, skipping insertion in model container [2018-07-22 06:01:52,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 06:01:52" (1/1) ... [2018-07-22 06:01:52,916 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-22 06:01:53,178 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 06:01:53,195 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-22 06:01:53,328 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-22 06:01:53,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53 WrapperNode [2018-07-22 06:01:53,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-22 06:01:53,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-22 06:01:53,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-22 06:01:53,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-22 06:01:53,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-22 06:01:53,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-22 06:01:53,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-22 06:01:53,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-22 06:01:53,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... [2018-07-22 06:01:53,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-22 06:01:53,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-22 06:01:53,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-22 06:01:53,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-22 06:01:53,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (1/1) ... No working directory specified, using /storage/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-07-22 06:01:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-22 06:01:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-22 06:01:53,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-22 06:01:56,883 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-22 06:01:56,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:01:56 BoogieIcfgContainer [2018-07-22 06:01:56,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-22 06:01:56,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-22 06:01:56,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-22 06:01:56,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-22 06:01:56,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 06:01:52" (1/3) ... [2018-07-22 06:01:56,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395ca03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 06:01:56, skipping insertion in model container [2018-07-22 06:01:56,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:01:53" (2/3) ... [2018-07-22 06:01:56,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395ca03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 06:01:56, skipping insertion in model container [2018-07-22 06:01:56,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:01:56" (3/3) ... [2018-07-22 06:01:56,892 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-07-22 06:01:56,901 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-22 06:01:56,910 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-22 06:01:56,964 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-22 06:01:56,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-22 06:01:56,965 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-22 06:01:56,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-22 06:01:56,965 INFO L376 AbstractCegarLoop]: Backedges is TWOTRACK [2018-07-22 06:01:56,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-22 06:01:56,966 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-22 06:01:56,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-22 06:01:56,966 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-22 06:01:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2018-07-22 06:01:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-22 06:01:57,004 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:01:57,005 INFO L358 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] [2018-07-22 06:01:57,005 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:01:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash 746696132, now seen corresponding path program 1 times [2018-07-22 06:01:57,013 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:01:57,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:01:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:01:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:01:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:01:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:01:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:01:57,602 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:01:57,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 06:01:57,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 06:01:57,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 06:01:57,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:01:57,627 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 4 states. [2018-07-22 06:02:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:00,124 INFO L93 Difference]: Finished difference Result 779 states and 1357 transitions. [2018-07-22 06:02:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 06:02:00,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-07-22 06:02:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:00,147 INFO L225 Difference]: With dead ends: 779 [2018-07-22 06:02:00,147 INFO L226 Difference]: Without dead ends: 544 [2018-07-22 06:02:00,152 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:02:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-07-22 06:02:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370. [2018-07-22 06:02:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-07-22 06:02:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 594 transitions. [2018-07-22 06:02:00,247 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 594 transitions. Word has length 112 [2018-07-22 06:02:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:00,248 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 594 transitions. [2018-07-22 06:02:00,248 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 06:02:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 594 transitions. [2018-07-22 06:02:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-22 06:02:00,253 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:00,253 INFO L358 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 06:02:00,254 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1148685391, now seen corresponding path program 1 times [2018-07-22 06:02:00,254 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:00,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:00,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:02:00,636 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:00,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-22 06:02:00,684 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 06:02:00,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 06:02:00,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:02:00,685 INFO L87 Difference]: Start difference. First operand 370 states and 594 transitions. Second operand 4 states. [2018-07-22 06:02:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:02,101 INFO L93 Difference]: Finished difference Result 1308 states and 2193 transitions. [2018-07-22 06:02:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 06:02:02,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-07-22 06:02:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:02,116 INFO L225 Difference]: With dead ends: 1308 [2018-07-22 06:02:02,116 INFO L226 Difference]: Without dead ends: 940 [2018-07-22 06:02:02,126 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:02:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-07-22 06:02:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 936. [2018-07-22 06:02:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-07-22 06:02:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1410 transitions. [2018-07-22 06:02:02,201 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1410 transitions. Word has length 117 [2018-07-22 06:02:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1410 transitions. [2018-07-22 06:02:02,202 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 06:02:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1410 transitions. [2018-07-22 06:02:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-22 06:02:02,209 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:02,209 INFO L358 BasicCegarLoop]: trace histogram [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-07-22 06:02:02,210 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash 985958592, now seen corresponding path program 1 times [2018-07-22 06:02:02,210 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:02,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:02,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:02,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:02,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:02:02,301 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:02,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-22 06:02:02,302 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 06:02:02,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 06:02:02,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 06:02:02,303 INFO L87 Difference]: Start difference. First operand 936 states and 1410 transitions. Second operand 3 states. [2018-07-22 06:02:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:04,014 INFO L93 Difference]: Finished difference Result 2716 states and 4131 transitions. [2018-07-22 06:02:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 06:02:04,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-07-22 06:02:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:04,024 INFO L225 Difference]: With dead ends: 2716 [2018-07-22 06:02:04,024 INFO L226 Difference]: Without dead ends: 1782 [2018-07-22 06:02:04,026 INFO L578 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-07-22 06:02:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2018-07-22 06:02:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1782. [2018-07-22 06:02:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2018-07-22 06:02:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2522 transitions. [2018-07-22 06:02:04,079 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2522 transitions. Word has length 123 [2018-07-22 06:02:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:04,079 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2522 transitions. [2018-07-22 06:02:04,079 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 06:02:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2522 transitions. [2018-07-22 06:02:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-22 06:02:04,083 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:04,084 INFO L358 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 06:02:04,084 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash -659353377, now seen corresponding path program 1 times [2018-07-22 06:02:04,084 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-22 06:02:04,251 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:04,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 06:02:04,252 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 06:02:04,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 06:02:04,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:02:04,252 INFO L87 Difference]: Start difference. First operand 1782 states and 2522 transitions. Second operand 4 states. [2018-07-22 06:02:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:04,874 INFO L93 Difference]: Finished difference Result 4956 states and 6950 transitions. [2018-07-22 06:02:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 06:02:04,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-07-22 06:02:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:04,888 INFO L225 Difference]: With dead ends: 4956 [2018-07-22 06:02:04,889 INFO L226 Difference]: Without dead ends: 3176 [2018-07-22 06:02:04,892 INFO L578 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-07-22 06:02:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2018-07-22 06:02:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 3176. [2018-07-22 06:02:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2018-07-22 06:02:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 4124 transitions. [2018-07-22 06:02:04,985 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 4124 transitions. Word has length 124 [2018-07-22 06:02:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 3176 states and 4124 transitions. [2018-07-22 06:02:04,986 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 06:02:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 4124 transitions. [2018-07-22 06:02:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-22 06:02:04,992 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:04,992 INFO L358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 06:02:04,992 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1931898934, now seen corresponding path program 1 times [2018-07-22 06:02:04,994 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:04,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:04,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:04,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:04,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:02:05,150 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:05,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 06:02:05,151 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-22 06:02:05,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-22 06:02:05,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:02:05,151 INFO L87 Difference]: Start difference. First operand 3176 states and 4124 transitions. Second operand 4 states. [2018-07-22 06:02:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:05,882 INFO L93 Difference]: Finished difference Result 6480 states and 8407 transitions. [2018-07-22 06:02:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-22 06:02:05,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-07-22 06:02:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:05,893 INFO L225 Difference]: With dead ends: 6480 [2018-07-22 06:02:05,893 INFO L226 Difference]: Without dead ends: 3306 [2018-07-22 06:02:05,897 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-22 06:02:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2018-07-22 06:02:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3306. [2018-07-22 06:02:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-07-22 06:02:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 3898 transitions. [2018-07-22 06:02:05,972 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 3898 transitions. Word has length 137 [2018-07-22 06:02:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:05,972 INFO L471 AbstractCegarLoop]: Abstraction has 3306 states and 3898 transitions. [2018-07-22 06:02:05,972 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-22 06:02:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 3898 transitions. [2018-07-22 06:02:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-22 06:02:05,979 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:05,979 INFO L358 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 06:02:05,979 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 818992916, now seen corresponding path program 1 times [2018-07-22 06:02:05,980 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:05,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:05,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:02:06,103 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:06,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 06:02:06,104 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 06:02:06,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 06:02:06,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 06:02:06,105 INFO L87 Difference]: Start difference. First operand 3306 states and 3898 transitions. Second operand 3 states. [2018-07-22 06:02:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:06,949 INFO L93 Difference]: Finished difference Result 9290 states and 10996 transitions. [2018-07-22 06:02:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 06:02:06,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-07-22 06:02:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:06,969 INFO L225 Difference]: With dead ends: 9290 [2018-07-22 06:02:06,969 INFO L226 Difference]: Without dead ends: 5702 [2018-07-22 06:02:06,973 INFO L578 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-07-22 06:02:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2018-07-22 06:02:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5698. [2018-07-22 06:02:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5698 states. [2018-07-22 06:02:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 6554 transitions. [2018-07-22 06:02:07,088 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 6554 transitions. Word has length 147 [2018-07-22 06:02:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:07,088 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 6554 transitions. [2018-07-22 06:02:07,088 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 06:02:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 6554 transitions. [2018-07-22 06:02:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-22 06:02:07,096 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:07,096 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 06:02:07,096 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash 955169793, now seen corresponding path program 1 times [2018-07-22 06:02:07,096 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:07,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:07,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:07,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-22 06:02:07,225 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:07,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 06:02:07,226 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 06:02:07,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 06:02:07,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 06:02:07,226 INFO L87 Difference]: Start difference. First operand 5698 states and 6554 transitions. Second operand 3 states. [2018-07-22 06:02:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:07,866 INFO L93 Difference]: Finished difference Result 10113 states and 11630 transitions. [2018-07-22 06:02:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 06:02:07,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-07-22 06:02:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:07,872 INFO L225 Difference]: With dead ends: 10113 [2018-07-22 06:02:07,872 INFO L226 Difference]: Without dead ends: 2276 [2018-07-22 06:02:07,876 INFO L578 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-07-22 06:02:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2018-07-22 06:02:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2276. [2018-07-22 06:02:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2018-07-22 06:02:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 2441 transitions. [2018-07-22 06:02:07,918 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 2441 transitions. Word has length 152 [2018-07-22 06:02:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:07,918 INFO L471 AbstractCegarLoop]: Abstraction has 2276 states and 2441 transitions. [2018-07-22 06:02:07,918 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 06:02:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2441 transitions. [2018-07-22 06:02:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-22 06:02:07,927 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:07,927 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-22 06:02:07,927 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:07,928 INFO L82 PathProgramCache]: Analyzing trace with hash -112433714, now seen corresponding path program 1 times [2018-07-22 06:02:07,928 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:07,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:07,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:07,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:07,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-07-22 06:02:08,084 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-22 06:02:08,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-22 06:02:08,084 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-22 06:02:08,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-22 06:02:08,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-22 06:02:08,085 INFO L87 Difference]: Start difference. First operand 2276 states and 2441 transitions. Second operand 3 states. [2018-07-22 06:02:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:09,769 INFO L93 Difference]: Finished difference Result 4270 states and 4594 transitions. [2018-07-22 06:02:09,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-22 06:02:09,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-07-22 06:02:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:09,776 INFO L225 Difference]: With dead ends: 4270 [2018-07-22 06:02:09,776 INFO L226 Difference]: Without dead ends: 1853 [2018-07-22 06:02:09,778 INFO L578 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-07-22 06:02:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2018-07-22 06:02:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1850. [2018-07-22 06:02:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2018-07-22 06:02:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 1984 transitions. [2018-07-22 06:02:09,812 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 1984 transitions. Word has length 162 [2018-07-22 06:02:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:09,812 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 1984 transitions. [2018-07-22 06:02:09,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-22 06:02:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 1984 transitions. [2018-07-22 06:02:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-22 06:02:09,817 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:09,817 INFO L358 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2018-07-22 06:02:09,817 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1006856705, now seen corresponding path program 1 times [2018-07-22 06:02:09,818 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:09,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:09,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:10,217 WARN L169 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-22 06:02:10,427 WARN L169 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-07-22 06:02:10,710 WARN L169 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-07-22 06:02:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-07-22 06:02:10,857 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 06:02:10,857 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 06:02:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:10,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 06:02:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-22 06:02:11,158 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 06:02:11,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-07-22 06:02:11,159 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-22 06:02:11,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-22 06:02:11,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-07-22 06:02:11,159 INFO L87 Difference]: Start difference. First operand 1850 states and 1984 transitions. Second operand 8 states. [2018-07-22 06:02:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:14,284 INFO L93 Difference]: Finished difference Result 3734 states and 4010 transitions. [2018-07-22 06:02:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-22 06:02:14,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2018-07-22 06:02:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:14,290 INFO L225 Difference]: With dead ends: 3734 [2018-07-22 06:02:14,290 INFO L226 Difference]: Without dead ends: 1881 [2018-07-22 06:02:14,292 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-07-22 06:02:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2018-07-22 06:02:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1708. [2018-07-22 06:02:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2018-07-22 06:02:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1818 transitions. [2018-07-22 06:02:14,335 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1818 transitions. Word has length 178 [2018-07-22 06:02:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:14,335 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 1818 transitions. [2018-07-22 06:02:14,336 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-22 06:02:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1818 transitions. [2018-07-22 06:02:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-22 06:02:14,341 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:14,341 INFO L358 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-22 06:02:14,342 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1547759438, now seen corresponding path program 1 times [2018-07-22 06:02:14,343 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:14,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:14,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:14,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 162 proven. 5 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-07-22 06:02:14,792 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 06:02:14,793 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 06:02:14,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:14,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 06:02:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-07-22 06:02:14,960 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-22 06:02:14,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-07-22 06:02:14,961 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-22 06:02:14,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-22 06:02:14,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 06:02:14,961 INFO L87 Difference]: Start difference. First operand 1708 states and 1818 transitions. Second operand 5 states. [2018-07-22 06:02:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:15,674 INFO L93 Difference]: Finished difference Result 3416 states and 3644 transitions. [2018-07-22 06:02:15,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-22 06:02:15,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2018-07-22 06:02:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:15,678 INFO L225 Difference]: With dead ends: 3416 [2018-07-22 06:02:15,678 INFO L226 Difference]: Without dead ends: 1283 [2018-07-22 06:02:15,679 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-22 06:02:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2018-07-22 06:02:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2018-07-22 06:02:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-07-22 06:02:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1320 transitions. [2018-07-22 06:02:15,703 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1320 transitions. Word has length 240 [2018-07-22 06:02:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:15,704 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1320 transitions. [2018-07-22 06:02:15,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-22 06:02:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1320 transitions. [2018-07-22 06:02:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-22 06:02:15,711 INFO L350 BasicCegarLoop]: Found error trace [2018-07-22 06:02:15,711 INFO L358 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, 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] [2018-07-22 06:02:15,711 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-22 06:02:15,713 INFO L82 PathProgramCache]: Analyzing trace with hash 620541118, now seen corresponding path program 1 times [2018-07-22 06:02:15,713 INFO L219 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-22 06:02:15,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-22 06:02:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:15,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-22 06:02:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 180 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:02:16,250 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-22 06:02:16,251 INFO L219 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-22 06:02:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-22 06:02:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-22 06:02:16,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-22 06:02:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 196 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-22 06:02:16,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-22 06:02:16,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-07-22 06:02:16,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-22 06:02:16,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-22 06:02:16,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-07-22 06:02:16,619 INFO L87 Difference]: Start difference. First operand 1283 states and 1320 transitions. Second operand 11 states. [2018-07-22 06:02:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-22 06:02:18,031 INFO L93 Difference]: Finished difference Result 2309 states and 2381 transitions. [2018-07-22 06:02:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-22 06:02:18,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 250 [2018-07-22 06:02:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-22 06:02:18,031 INFO L225 Difference]: With dead ends: 2309 [2018-07-22 06:02:18,032 INFO L226 Difference]: Without dead ends: 0 [2018-07-22 06:02:18,033 INFO L578 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-07-22 06:02:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-22 06:02:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-22 06:02:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-22 06:02:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-22 06:02:18,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 250 [2018-07-22 06:02:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-22 06:02:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-22 06:02:18,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-22 06:02:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-22 06:02:18,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-22 06:02:18,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-22 06:02:18,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-22 06:02:18,419 WARN L169 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-07-22 06:02:18,704 WARN L169 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-07-22 06:02:18,706 INFO L421 ceAbstractionStarter]: For program point L203''(lines 203 210) no Hoare annotation was computed. [2018-07-22 06:02:18,707 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-22 06:02:18,707 INFO L421 ceAbstractionStarter]: For program point L504'(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,707 INFO L421 ceAbstractionStarter]: For program point L238''(lines 238 246) no Hoare annotation was computed. [2018-07-22 06:02:18,707 INFO L421 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-07-22 06:02:18,707 INFO L421 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,707 INFO L421 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-07-22 06:02:18,708 INFO L421 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,710 INFO L421 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-07-22 06:02:18,712 INFO L421 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,712 INFO L421 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-07-22 06:02:18,712 INFO L421 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,712 INFO L421 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-07-22 06:02:18,712 INFO L421 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,712 INFO L421 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L417 ceAbstractionStarter]: At program point L606''(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (.cse7 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse4 (not .cse7)) (.cse0 (not .cse6)) (.cse9 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse8 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1)) (.cse11 (not .cse2)) (.cse5 (not (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 11))) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse10 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse1 .cse4 .cse2 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse9) (and .cse1 .cse7 .cse8 (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3)) .cse0 .cse3) (and .cse1 .cse7 .cse8 .cse10) (and .cse11 .cse6 .cse5 .cse9) (and .cse7 .cse8 .cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (and .cse1 .cse8 .cse11 .cse5 .cse3) (and .cse1 .cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0) .cse3)))) [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,713 INFO L421 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,714 INFO L421 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L332''(lines 332 335) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-07-22 06:02:18,715 INFO L421 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L298''(lines 298 307) no Hoare annotation was computed. [2018-07-22 06:02:18,716 INFO L421 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L417 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 7)) (.cse6 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11~0 1)) (.cse7 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25~0 1))) (let ((.cse4 (not .cse7)) (.cse0 (not .cse6)) (.cse9 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse8 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 1)) (.cse11 (not .cse2)) (.cse5 (not (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 11))) (.cse1 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 8)) (.cse10 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28~0 10)) (.cse3 (= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse1 .cse4 .cse2 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse9) (and .cse1 .cse7 .cse8 (not (= ULTIMATE.start___U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output_~input 3)) .cse0 .cse3) (and .cse1 .cse7 .cse8 .cse10) (and .cse11 .cse6 .cse5 .cse9) (and .cse7 .cse8 .cse2 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 7)) (and .cse1 .cse8 .cse11 .cse5 .cse3) (and .cse1 .cse10 (<= ~__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19~0 0) .cse3)))) [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-07-22 06:02:18,717 INFO L421 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L75''(lines 75 80) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-07-22 06:02:18,718 INFO L421 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L381''(lines 381 387) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L315''(lines 315 326) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-07-22 06:02:18,719 INFO L421 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-07-22 06:02:18,720 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L424 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L606(lines 606 616) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-07-22 06:02:18,721 INFO L421 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,722 INFO L421 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,723 INFO L421 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-07-22 06:02:18,724 INFO L421 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-07-22 06:02:18,725 INFO L421 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,726 INFO L421 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-07-22 06:02:18,727 INFO L421 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-07-22 06:02:18,728 INFO L421 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 505) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L83''(lines 83 89) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L338''(lines 338 347) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L262''(lines 262 274) no Hoare annotation was computed. [2018-07-22 06:02:18,729 INFO L421 ceAbstractionStarter]: For program point L414'(lines 29 598) no Hoare annotation was computed. [2018-07-22 06:02:18,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 06:02:18 BoogieIcfgContainer [2018-07-22 06:02:18,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-22 06:02:18,762 INFO L168 Benchmark]: Toolchain (without parser) took 26080.97 ms. Allocated memory was 309.3 MB in the beginning and 701.5 MB in the end (delta: 392.2 MB). Free memory was 251.2 MB in the beginning and 592.9 MB in the end (delta: -341.7 MB). Peak memory consumption was 323.6 MB. Max. memory is 5.3 GB. [2018-07-22 06:02:18,763 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-07-22 06:02:18,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.36 ms. Allocated memory is still 309.3 MB. Free memory was 251.2 MB in the beginning and 219.1 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 5.3 GB. [2018-07-22 06:02:18,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.17 ms. Allocated memory is still 309.3 MB. Free memory was 219.1 MB in the beginning and 214.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. [2018-07-22 06:02:18,764 INFO L168 Benchmark]: Boogie Preprocessor took 69.47 ms. Allocated memory is still 309.3 MB. Free memory was 214.1 MB in the beginning and 209.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. [2018-07-22 06:02:18,765 INFO L168 Benchmark]: RCFGBuilder took 3326.12 ms. Allocated memory was 309.3 MB in the beginning and 483.4 MB in the end (delta: 174.1 MB). Free memory was 209.1 MB in the beginning and 342.2 MB in the end (delta: -133.1 MB). Peak memory consumption was 57.2 MB. Max. memory is 5.3 GB. [2018-07-22 06:02:18,766 INFO L168 Benchmark]: TraceAbstraction took 21876.03 ms. Allocated memory was 483.4 MB in the beginning and 701.5 MB in the end (delta: 218.1 MB). Free memory was 342.2 MB in the beginning and 592.9 MB in the end (delta: -250.7 MB). Peak memory consumption was 240.6 MB. Max. memory is 5.3 GB. [2018-07-22 06:02:18,770 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.19 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 691.36 ms. Allocated memory is still 309.3 MB. Free memory was 251.2 MB in the beginning and 219.1 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 5.3 GB. * Boogie Procedure Inliner took 103.17 ms. Allocated memory is still 309.3 MB. Free memory was 219.1 MB in the beginning and 214.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 69.47 ms. Allocated memory is still 309.3 MB. Free memory was 214.1 MB in the beginning and 209.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 3326.12 ms. Allocated memory was 309.3 MB in the beginning and 483.4 MB in the end (delta: 174.1 MB). Free memory was 209.1 MB in the beginning and 342.2 MB in the end (delta: -133.1 MB). Peak memory consumption was 57.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 21876.03 ms. Allocated memory was 483.4 MB in the beginning and 701.5 MB in the end (delta: 218.1 MB). Free memory was 342.2 MB in the beginning and 592.9 MB in the end (delta: -250.7 MB). Peak memory consumption was 240.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) || ((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && !(input == 3)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) || ((((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8)) || (((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && !(input == 3)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10)) || (((!(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a11 == 1) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 8)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a25 == 1 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 <= 7)) || ((((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 == 1) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 7)) && !(__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 11)) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 8 && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a28 == 10) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a19 <= 0) && __U_MULTI_f_storage_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 1 error locations. SAFE Result, 21.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1556 SDtfs, 4445 SDslu, 629 SDs, 0 SdLazy, 8534 SolverSat, 1295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 722 GetRequests, 681 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5698occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 358 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 89 NumberOfFragments, 309 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2709 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 350 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2396 ConstructedInterpolants, 0 QuantifiedInterpolants, 1426364 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1103 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1302/1430 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem02_label39_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-22_06-02-18-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Problem02_label39_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-22_06-02-18-788.csv Received shutdown request...