java -Xmx8000000000 -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 csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:19:26,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:19:26,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:19:26,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:19:26,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:19:26,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:19:26,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:19:26,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:19:26,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:19:26,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:19:26,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:19:26,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:19:26,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:19:26,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:19:27,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:19:27,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:19:27,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:19:27,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:19:27,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:19:27,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:19:27,009 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:19:27,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:19:27,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:19:27,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:19:27,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:19:27,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:19:27,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:19:27,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:19:27,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:19:27,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:19:27,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:19:27,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:19:27,019 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:19:27,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:19:27,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:19:27,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:19:27,021 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 01:19:27,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:19:27,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:19:27,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:19:27,048 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:19:27,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:19:27,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:19:27,049 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:19:27,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:19:27,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:19:27,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:19:27,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:19:27,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:19:27,050 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:19:27,050 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:19:27,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:19:27,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:19:27,051 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:19:27,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:19:27,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:19:27,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:19:27,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:19:27,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:19:27,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:19:27,052 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:19:27,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:19:27,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:19:27,053 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:19:27,053 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:19:27,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:19:27,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:19:27,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:19:27,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:19:27,117 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:19:27,118 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-07-24 01:19:27,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3007ddc03/d8e1b643b211479bb016171097484998/FLAG4ba4c2d74 [2018-07-24 01:19:27,723 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:19:27,726 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-07-24 01:19:27,747 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3007ddc03/d8e1b643b211479bb016171097484998/FLAG4ba4c2d74 [2018-07-24 01:19:27,770 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3007ddc03/d8e1b643b211479bb016171097484998 [2018-07-24 01:19:27,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:19:27,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:19:27,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:19:27,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:19:27,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:19:27,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:19:27" (1/1) ... [2018-07-24 01:19:27,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e225eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:27, skipping insertion in model container [2018-07-24 01:19:27,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:19:27" (1/1) ... [2018-07-24 01:19:28,036 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:19:28,364 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:19:28,381 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:19:28,532 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:19:28,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28 WrapperNode [2018-07-24 01:19:28,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:19:28,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:19:28,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:19:28,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:19:28,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:19:28,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:19:28,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:19:28,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:19:28,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... [2018-07-24 01:19:28,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:19:28,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:19:28,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:19:28,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:19:28,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:19:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:19:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:19:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:19:32,459 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:19:32,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:19:32 BoogieIcfgContainer [2018-07-24 01:19:32,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:19:32,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:19:32,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:19:32,472 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:19:32,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:19:27" (1/3) ... [2018-07-24 01:19:32,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:19:32, skipping insertion in model container [2018-07-24 01:19:32,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:19:28" (2/3) ... [2018-07-24 01:19:32,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:19:32, skipping insertion in model container [2018-07-24 01:19:32,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:19:32" (3/3) ... [2018-07-24 01:19:32,483 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label14_true-unreach-call_false-termination.c [2018-07-24 01:19:32,493 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:19:32,505 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:19:32,573 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:19:32,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:19:32,574 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:19:32,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:19:32,577 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:19:32,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:19:32,577 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:19:32,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:19:32,578 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:19:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-07-24 01:19:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-24 01:19:32,626 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:32,628 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:32,629 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 782686367, now seen corresponding path program 1 times [2018-07-24 01:19:32,640 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:32,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:32,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:33,540 WARN L169 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-07-24 01:19:34,012 WARN L169 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-07-24 01:19:34,340 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-07-24 01:19:34,657 WARN L169 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-07-24 01:19:34,905 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-24 01:19:34,908 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:34,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-07-24 01:19:34,913 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 01:19:34,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 01:19:34,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:19:34,931 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 10 states. [2018-07-24 01:19:35,133 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-07-24 01:19:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:37,734 INFO L93 Difference]: Finished difference Result 636 states and 1117 transitions. [2018-07-24 01:19:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-24 01:19:37,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-07-24 01:19:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:37,755 INFO L225 Difference]: With dead ends: 636 [2018-07-24 01:19:37,755 INFO L226 Difference]: Without dead ends: 254 [2018-07-24 01:19:37,761 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-07-24 01:19:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-24 01:19:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-07-24 01:19:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-07-24 01:19:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2018-07-24 01:19:37,825 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 132 [2018-07-24 01:19:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2018-07-24 01:19:37,826 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 01:19:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2018-07-24 01:19:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-24 01:19:37,833 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:37,834 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:37,839 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2122611721, now seen corresponding path program 1 times [2018-07-24 01:19:37,840 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:37,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:38,094 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-24 01:19:38,095 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:38,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:19:38,100 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:19:38,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:19:38,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:19:38,101 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 3 states. [2018-07-24 01:19:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:39,586 INFO L93 Difference]: Finished difference Result 579 states and 960 transitions. [2018-07-24 01:19:39,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:19:39,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-07-24 01:19:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:39,593 INFO L225 Difference]: With dead ends: 579 [2018-07-24 01:19:39,593 INFO L226 Difference]: Without dead ends: 386 [2018-07-24 01:19:39,595 INFO L573 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-24 01:19:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-07-24 01:19:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-07-24 01:19:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-07-24 01:19:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 589 transitions. [2018-07-24 01:19:39,619 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 589 transitions. Word has length 137 [2018-07-24 01:19:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 589 transitions. [2018-07-24 01:19:39,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:19:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 589 transitions. [2018-07-24 01:19:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-24 01:19:39,624 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:39,624 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:39,624 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 324325939, now seen corresponding path program 1 times [2018-07-24 01:19:39,625 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:39,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:19:39,922 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:39,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:19:39,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:39,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:39,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:39,923 INFO L87 Difference]: Start difference. First operand 386 states and 589 transitions. Second operand 4 states. [2018-07-24 01:19:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:41,459 INFO L93 Difference]: Finished difference Result 1107 states and 1833 transitions. [2018-07-24 01:19:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:19:41,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-07-24 01:19:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:41,466 INFO L225 Difference]: With dead ends: 1107 [2018-07-24 01:19:41,466 INFO L226 Difference]: Without dead ends: 649 [2018-07-24 01:19:41,469 INFO L573 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-24 01:19:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-07-24 01:19:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2018-07-24 01:19:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-07-24 01:19:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 835 transitions. [2018-07-24 01:19:41,512 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 835 transitions. Word has length 140 [2018-07-24 01:19:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:41,512 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 835 transitions. [2018-07-24 01:19:41,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 835 transitions. [2018-07-24 01:19:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-24 01:19:41,516 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:41,516 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:41,516 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1685622847, now seen corresponding path program 1 times [2018-07-24 01:19:41,517 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:41,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:41,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 01:19:41,671 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:41,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:19:41,672 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:19:41,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:19:41,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:19:41,673 INFO L87 Difference]: Start difference. First operand 649 states and 835 transitions. Second operand 3 states. [2018-07-24 01:19:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:44,021 INFO L93 Difference]: Finished difference Result 1501 states and 2029 transitions. [2018-07-24 01:19:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:19:44,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2018-07-24 01:19:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:44,027 INFO L225 Difference]: With dead ends: 1501 [2018-07-24 01:19:44,027 INFO L226 Difference]: Without dead ends: 913 [2018-07-24 01:19:44,029 INFO L573 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-24 01:19:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-07-24 01:19:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2018-07-24 01:19:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-07-24 01:19:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1165 transitions. [2018-07-24 01:19:44,050 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1165 transitions. Word has length 149 [2018-07-24 01:19:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:44,051 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1165 transitions. [2018-07-24 01:19:44,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:19:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1165 transitions. [2018-07-24 01:19:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-24 01:19:44,054 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:44,054 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:44,054 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -924755472, now seen corresponding path program 1 times [2018-07-24 01:19:44,055 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:44,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:44,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 01:19:44,214 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:44,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:19:44,215 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:19:44,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:19:44,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:19:44,215 INFO L87 Difference]: Start difference. First operand 913 states and 1165 transitions. Second operand 4 states. [2018-07-24 01:19:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:45,595 INFO L93 Difference]: Finished difference Result 3349 states and 4353 transitions. [2018-07-24 01:19:45,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:19:45,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-07-24 01:19:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:45,608 INFO L225 Difference]: With dead ends: 3349 [2018-07-24 01:19:45,608 INFO L226 Difference]: Without dead ends: 2497 [2018-07-24 01:19:45,610 INFO L573 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-24 01:19:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2018-07-24 01:19:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2497. [2018-07-24 01:19:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2497 states. [2018-07-24 01:19:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 3065 transitions. [2018-07-24 01:19:45,664 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 3065 transitions. Word has length 159 [2018-07-24 01:19:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:45,664 INFO L471 AbstractCegarLoop]: Abstraction has 2497 states and 3065 transitions. [2018-07-24 01:19:45,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:19:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 3065 transitions. [2018-07-24 01:19:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-24 01:19:45,671 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:45,671 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:45,671 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1079275118, now seen corresponding path program 1 times [2018-07-24 01:19:45,672 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:45,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:45,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-07-24 01:19:45,880 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:45,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:19:45,880 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:19:45,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:19:45,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:45,901 INFO L87 Difference]: Start difference. First operand 2497 states and 3065 transitions. Second operand 5 states. [2018-07-24 01:19:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:47,169 INFO L93 Difference]: Finished difference Result 5197 states and 6462 transitions. [2018-07-24 01:19:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:19:47,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2018-07-24 01:19:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:47,182 INFO L225 Difference]: With dead ends: 5197 [2018-07-24 01:19:47,182 INFO L226 Difference]: Without dead ends: 2761 [2018-07-24 01:19:47,186 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:19:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2018-07-24 01:19:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2761. [2018-07-24 01:19:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-07-24 01:19:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3366 transitions. [2018-07-24 01:19:47,234 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3366 transitions. Word has length 187 [2018-07-24 01:19:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:47,234 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3366 transitions. [2018-07-24 01:19:47,234 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:19:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3366 transitions. [2018-07-24 01:19:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-24 01:19:47,241 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:47,241 INFO L353 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:47,241 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1129165529, now seen corresponding path program 1 times [2018-07-24 01:19:47,242 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:47,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:47,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:47,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:47,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-07-24 01:19:47,435 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:47,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:19:47,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:19:47,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:19:47,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:19:47,436 INFO L87 Difference]: Start difference. First operand 2761 states and 3366 transitions. Second operand 3 states. [2018-07-24 01:19:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:48,293 INFO L93 Difference]: Finished difference Result 6253 states and 7818 transitions. [2018-07-24 01:19:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:19:48,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-07-24 01:19:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:48,309 INFO L225 Difference]: With dead ends: 6253 [2018-07-24 01:19:48,310 INFO L226 Difference]: Without dead ends: 3553 [2018-07-24 01:19:48,314 INFO L573 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-24 01:19:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2018-07-24 01:19:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3553. [2018-07-24 01:19:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3553 states. [2018-07-24 01:19:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4287 transitions. [2018-07-24 01:19:48,367 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4287 transitions. Word has length 208 [2018-07-24 01:19:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 4287 transitions. [2018-07-24 01:19:48,368 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:19:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4287 transitions. [2018-07-24 01:19:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-24 01:19:48,375 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:48,376 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:48,376 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 284601622, now seen corresponding path program 1 times [2018-07-24 01:19:48,377 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:48,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:48,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:48,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 01:19:48,701 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:19:48,701 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:19:48,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:48,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:19:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-07-24 01:19:49,102 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:19:49,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-07-24 01:19:49,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:19:49,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:19:49,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:19:49,104 INFO L87 Difference]: Start difference. First operand 3553 states and 4287 transitions. Second operand 7 states. [2018-07-24 01:19:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:53,816 INFO L93 Difference]: Finished difference Result 9821 states and 11940 transitions. [2018-07-24 01:19:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 01:19:53,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 238 [2018-07-24 01:19:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:53,828 INFO L225 Difference]: With dead ends: 9821 [2018-07-24 01:19:53,828 INFO L226 Difference]: Without dead ends: 3002 [2018-07-24 01:19:53,835 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:19:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2018-07-24 01:19:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2726. [2018-07-24 01:19:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-07-24 01:19:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 2970 transitions. [2018-07-24 01:19:53,879 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 2970 transitions. Word has length 238 [2018-07-24 01:19:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:53,880 INFO L471 AbstractCegarLoop]: Abstraction has 2726 states and 2970 transitions. [2018-07-24 01:19:53,880 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:19:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 2970 transitions. [2018-07-24 01:19:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-24 01:19:53,887 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:53,888 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:53,888 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash 230766921, now seen corresponding path program 1 times [2018-07-24 01:19:53,888 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:53,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:53,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:53,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:53,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:54,249 WARN L169 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-07-24 01:19:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-07-24 01:19:54,437 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:54,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-24 01:19:54,438 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:19:54,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:19:54,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:19:54,438 INFO L87 Difference]: Start difference. First operand 2726 states and 2970 transitions. Second operand 6 states. [2018-07-24 01:19:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:55,529 INFO L93 Difference]: Finished difference Result 5854 states and 6383 transitions. [2018-07-24 01:19:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:19:55,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 288 [2018-07-24 01:19:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:55,540 INFO L225 Difference]: With dead ends: 5854 [2018-07-24 01:19:55,541 INFO L226 Difference]: Without dead ends: 3189 [2018-07-24 01:19:55,544 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:19:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2018-07-24 01:19:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2858. [2018-07-24 01:19:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-07-24 01:19:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3086 transitions. [2018-07-24 01:19:55,588 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3086 transitions. Word has length 288 [2018-07-24 01:19:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:55,589 INFO L471 AbstractCegarLoop]: Abstraction has 2858 states and 3086 transitions. [2018-07-24 01:19:55,589 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:19:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3086 transitions. [2018-07-24 01:19:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-24 01:19:55,597 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:55,597 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:55,597 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1350105266, now seen corresponding path program 1 times [2018-07-24 01:19:55,598 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:55,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:55,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-07-24 01:19:56,335 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:19:56,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 01:19:56,335 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:19:56,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:19:56,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:19:56,336 INFO L87 Difference]: Start difference. First operand 2858 states and 3086 transitions. Second operand 6 states. [2018-07-24 01:19:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:19:57,694 INFO L93 Difference]: Finished difference Result 5920 states and 6410 transitions. [2018-07-24 01:19:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-24 01:19:57,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 310 [2018-07-24 01:19:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:19:57,704 INFO L225 Difference]: With dead ends: 5920 [2018-07-24 01:19:57,704 INFO L226 Difference]: Without dead ends: 2188 [2018-07-24 01:19:57,708 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:19:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2018-07-24 01:19:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2188. [2018-07-24 01:19:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2188 states. [2018-07-24 01:19:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 2323 transitions. [2018-07-24 01:19:57,742 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 2323 transitions. Word has length 310 [2018-07-24 01:19:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:19:57,743 INFO L471 AbstractCegarLoop]: Abstraction has 2188 states and 2323 transitions. [2018-07-24 01:19:57,743 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:19:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2323 transitions. [2018-07-24 01:19:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-24 01:19:57,751 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:19:57,752 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:19:57,752 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:19:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 466164416, now seen corresponding path program 1 times [2018-07-24 01:19:57,752 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:19:57,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:19:57,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:19:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:58,178 WARN L169 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-07-24 01:19:58,701 WARN L169 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-07-24 01:19:58,989 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-07-24 01:19:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 304 proven. 97 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-24 01:19:59,269 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:19:59,269 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:19:59,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:19:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:19:59,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:19:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-07-24 01:19:59,531 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:19:59,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-07-24 01:19:59,532 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 01:19:59,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 01:19:59,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-24 01:19:59,533 INFO L87 Difference]: Start difference. First operand 2188 states and 2323 transitions. Second operand 11 states. [2018-07-24 01:20:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:20:03,019 INFO L93 Difference]: Finished difference Result 4588 states and 4903 transitions. [2018-07-24 01:20:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-24 01:20:03,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 330 [2018-07-24 01:20:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:20:03,021 INFO L225 Difference]: With dead ends: 4588 [2018-07-24 01:20:03,021 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 01:20:03,025 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-24 01:20:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 01:20:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 01:20:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 01:20:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 01:20:03,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 330 [2018-07-24 01:20:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:20:03,027 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 01:20:03,027 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 01:20:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 01:20:03,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 01:20:03,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 01:20:03,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 01:20:03,520 WARN L169 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-07-24 01:20:03,781 WARN L169 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-07-24 01:20:03,786 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L391'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-07-24 01:20:03,787 INFO L421 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-07-24 01:20:03,788 INFO L421 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,789 INFO L421 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,790 INFO L421 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-07-24 01:20:03,791 INFO L421 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,792 INFO L421 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-07-24 01:20:03,793 INFO L421 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,794 INFO L421 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,795 INFO L421 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-07-24 01:20:03,796 INFO L421 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L583(lines 583 593) no Hoare annotation was computed. [2018-07-24 01:20:03,797 INFO L421 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-07-24 01:20:03,798 INFO L421 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,799 INFO L417 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (.cse7 (not .cse1)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (and .cse1 .cse2 .cse3 .cse4) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15) .cse1 .cse2 (not .cse0) .cse5 .cse6) (and .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse6) (and .cse3 .cse6) (and .cse8 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse7 .cse2 .cse6) (and .cse1 .cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1) .cse5 .cse6) (and .cse9 .cse7 .cse2 .cse4 .cse6) (and .cse0 .cse8 .cse2 .cse6)))) [2018-07-24 01:20:03,799 INFO L421 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-07-24 01:20:03,799 INFO L421 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,799 INFO L421 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-07-24 01:20:03,799 INFO L421 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L424 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,800 INFO L421 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,801 INFO L421 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-07-24 01:20:03,802 INFO L421 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-07-24 01:20:03,803 INFO L421 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L421 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,804 INFO L417 ceAbstractionStarter]: At program point L583''(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7~0 1))) (let ((.cse3 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 4)) (.cse9 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 6)) (.cse7 (not .cse1)) (.cse4 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 0)) (.cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20~0 1)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16~0 5)) (.cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 8)) (.cse6 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 1))) (or (and .cse0 .cse1 .cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 13)) (and .cse1 .cse2 .cse3 .cse4) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8~0 15) .cse1 .cse2 (not .cse0) .cse5 .cse6) (and .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse6) (and .cse3 .cse6) (and .cse8 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse7 .cse2 .cse6) (and .cse1 .cse2 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17~0 1) .cse5 .cse6) (and .cse9 .cse7 .cse2 .cse4 .cse6) (and .cse0 .cse8 .cse2 .cse6)))) [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,805 INFO L421 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startErr0AssertViolationERROR_FUNCTION(line 569) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-07-24 01:20:03,806 INFO L421 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L568'(lines 30 575) no Hoare annotation was computed. [2018-07-24 01:20:03,807 INFO L421 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-07-24 01:20:03,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:20:03 BoogieIcfgContainer [2018-07-24 01:20:03,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:20:03,852 INFO L168 Benchmark]: Toolchain (without parser) took 36073.00 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -278.0 MB). Peak memory consumption was 884.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:03,856 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:20:03,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:03,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:03,860 INFO L168 Benchmark]: Boogie Preprocessor took 200.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 782.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -886.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:03,861 INFO L168 Benchmark]: RCFGBuilder took 3554.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 116.9 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:03,862 INFO L168 Benchmark]: TraceAbstraction took 31386.55 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 379.6 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 438.7 MB). Peak memory consumption was 818.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:20:03,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 113.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 200.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 782.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -886.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3554.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 116.9 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31386.55 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 379.6 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 438.7 MB). Peak memory consumption was 818.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 <= 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 <= 13 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 13) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 <= 13) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0)) || (((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 == 15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a8 <= 13 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1) && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a17 == 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 4) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || ((((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 6 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a7 == 1)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 <= 0) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a20 == 1 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a16 == 5) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 == 8) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1581 SDtfs, 4504 SDslu, 887 SDs, 0 SdLazy, 10886 SolverSat, 1619 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 585 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3553occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 607 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 120 NumberOfFragments, 347 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4246 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 82 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2846 NumberOfCodeBlocks, 2846 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2833 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017138 SizeOfPredicates, 2 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 2460/2584 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/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label14_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-20-03-909.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem01_label14_true-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-20-03-909.csv Received shutdown request...