java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label38_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 12:03:47,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 12:03:47,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 12:03:47,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 12:03:47,109 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 12:03:47,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 12:03:47,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 12:03:47,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 12:03:47,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 12:03:47,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 12:03:47,117 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 12:03:47,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 12:03:47,118 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 12:03:47,119 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 12:03:47,120 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 12:03:47,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 12:03:47,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 12:03:47,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 12:03:47,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 12:03:47,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 12:03:47,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 12:03:47,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 12:03:47,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 12:03:47,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 12:03:47,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 12:03:47,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 12:03:47,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 12:03:47,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 12:03:47,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 12:03:47,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 12:03:47,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 12:03:47,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 12:03:47,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 12:03:47,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 12:03:47,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 12:03:47,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 12:03:47,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 12:03:47,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 12:03:47,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 12:03:47,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 12:03:47,172 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 12:03:47,172 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 12:03:47,173 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 12:03:47,173 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 12:03:47,173 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 12:03:47,173 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 12:03:47,173 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 12:03:47,174 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 12:03:47,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 12:03:47,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 12:03:47,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 12:03:47,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 12:03:47,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 12:03:47,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 12:03:47,178 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 12:03:47,178 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 12:03:47,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 12:03:47,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 12:03:47,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 12:03:47,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 12:03:47,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 12:03:47,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 12:03:47,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 12:03:47,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 12:03:47,180 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 12:03:47,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 12:03:47,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 12:03:47,181 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 12:03:47,181 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 12:03:47,181 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 12:03:47,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 12:03:47,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 12:03:47,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 12:03:47,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 12:03:47,266 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 12:03:47,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label38_true-unreach-call_false-termination.c [2018-09-10 12:03:47,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3db3dda/be5d71c725824dc5a891f72c9b8c9f07/FLAGa068c1f37 [2018-09-10 12:03:47,912 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 12:03:47,914 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label38_true-unreach-call_false-termination.c [2018-09-10 12:03:47,943 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3db3dda/be5d71c725824dc5a891f72c9b8c9f07/FLAGa068c1f37 [2018-09-10 12:03:47,965 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3db3dda/be5d71c725824dc5a891f72c9b8c9f07 [2018-09-10 12:03:47,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 12:03:47,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 12:03:47,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 12:03:47,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 12:03:47,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 12:03:47,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:03:47" (1/1) ... [2018-09-10 12:03:47,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408387f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:47, skipping insertion in model container [2018-09-10 12:03:47,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 12:03:47" (1/1) ... [2018-09-10 12:03:48,209 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 12:03:48,515 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:03:48,536 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 12:03:48,707 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 12:03:48,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48 WrapperNode [2018-09-10 12:03:48,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 12:03:48,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 12:03:48,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 12:03:48,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 12:03:48,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:48,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:48,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 12:03:48,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 12:03:48,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 12:03:48,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 12:03:49,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (1/1) ... [2018-09-10 12:03:49,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 12:03:49,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 12:03:49,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 12:03:49,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 12:03:49,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (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-09-10 12:03:49,257 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 12:03:49,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-09-10 12:03:49,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 12:03:49,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 12:03:49,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 12:03:49,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 12:03:49,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 12:03:49,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 12:03:53,033 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 12:03:53,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:03:53 BoogieIcfgContainer [2018-09-10 12:03:53,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 12:03:53,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 12:03:53,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 12:03:53,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 12:03:53,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 12:03:47" (1/3) ... [2018-09-10 12:03:53,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a703e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:03:53, skipping insertion in model container [2018-09-10 12:03:53,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 12:03:48" (2/3) ... [2018-09-10 12:03:53,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a703e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 12:03:53, skipping insertion in model container [2018-09-10 12:03:53,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 12:03:53" (3/3) ... [2018-09-10 12:03:53,043 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label38_true-unreach-call_false-termination.c [2018-09-10 12:03:53,051 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 12:03:53,060 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 12:03:53,111 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 12:03:53,112 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 12:03:53,113 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 12:03:53,113 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 12:03:53,113 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 12:03:53,113 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 12:03:53,116 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 12:03:53,116 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 12:03:53,116 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 12:03:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-10 12:03:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-10 12:03:53,155 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:53,156 INFO L376 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] [2018-09-10 12:03:53,157 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2125172087, now seen corresponding path program 1 times [2018-09-10 12:03:53,165 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:53,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:53,214 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:53,609 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:03:53,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 12:03:53,610 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:53,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 12:03:53,632 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 12:03:53,633 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:03:53,636 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-09-10 12:03:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:03:55,540 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-09-10 12:03:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 12:03:55,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-09-10 12:03:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:03:55,563 INFO L225 Difference]: With dead ends: 691 [2018-09-10 12:03:55,563 INFO L226 Difference]: Without dead ends: 434 [2018-09-10 12:03:55,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 12:03:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-09-10 12:03:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-09-10 12:03:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-10 12:03:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 773 transitions. [2018-09-10 12:03:55,666 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 773 transitions. Word has length 57 [2018-09-10 12:03:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:03:55,667 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 773 transitions. [2018-09-10 12:03:55,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 12:03:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 773 transitions. [2018-09-10 12:03:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-10 12:03:55,682 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:03:55,683 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:03:55,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:03:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash 285183594, now seen corresponding path program 1 times [2018-09-10 12:03:55,684 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:03:55,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:55,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:03:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:03:55,686 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:03:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:03:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:03:56,142 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:03:56,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:03:56,142 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:03:56,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:03:56,145 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:03:56,145 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:03:56,146 INFO L87 Difference]: Start difference. First operand 434 states and 773 transitions. Second operand 6 states. [2018-09-10 12:04:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:01,905 INFO L93 Difference]: Finished difference Result 1610 states and 2994 transitions. [2018-09-10 12:04:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 12:04:01,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-09-10 12:04:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:01,920 INFO L225 Difference]: With dead ends: 1610 [2018-09-10 12:04:01,920 INFO L226 Difference]: Without dead ends: 1182 [2018-09-10 12:04:01,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-10 12:04:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-09-10 12:04:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1142. [2018-09-10 12:04:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-09-10 12:04:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1838 transitions. [2018-09-10 12:04:02,033 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1838 transitions. Word has length 139 [2018-09-10 12:04:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:02,034 INFO L480 AbstractCegarLoop]: Abstraction has 1142 states and 1838 transitions. [2018-09-10 12:04:02,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:04:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1838 transitions. [2018-09-10 12:04:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-10 12:04:02,039 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:02,040 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:02,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash -962499826, now seen corresponding path program 1 times [2018-09-10 12:04:02,043 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:02,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:02,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:02,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:02,045 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:02,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:04:02,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-10 12:04:02,351 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:02,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:04:02,352 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:04:02,353 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-10 12:04:02,353 INFO L87 Difference]: Start difference. First operand 1142 states and 1838 transitions. Second operand 6 states. [2018-09-10 12:04:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:06,915 INFO L93 Difference]: Finished difference Result 2742 states and 4361 transitions. [2018-09-10 12:04:06,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-10 12:04:06,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-09-10 12:04:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:06,929 INFO L225 Difference]: With dead ends: 2742 [2018-09-10 12:04:06,930 INFO L226 Difference]: Without dead ends: 1606 [2018-09-10 12:04:06,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-10 12:04:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-09-10 12:04:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1534. [2018-09-10 12:04:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2018-09-10 12:04:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2340 transitions. [2018-09-10 12:04:07,001 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2340 transitions. Word has length 141 [2018-09-10 12:04:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:07,001 INFO L480 AbstractCegarLoop]: Abstraction has 1534 states and 2340 transitions. [2018-09-10 12:04:07,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:04:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2340 transitions. [2018-09-10 12:04:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-10 12:04:07,006 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:07,006 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:07,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1773846766, now seen corresponding path program 1 times [2018-09-10 12:04:07,007 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:07,009 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:07,289 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 12:04:07,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 12:04:07,289 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 12:04:07,290 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 12:04:07,290 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:04:07,291 INFO L87 Difference]: Start difference. First operand 1534 states and 2340 transitions. Second operand 4 states. [2018-09-10 12:04:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:09,716 INFO L93 Difference]: Finished difference Result 4834 states and 7760 transitions. [2018-09-10 12:04:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 12:04:09,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-09-10 12:04:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:09,742 INFO L225 Difference]: With dead ends: 4834 [2018-09-10 12:04:09,743 INFO L226 Difference]: Without dead ends: 3306 [2018-09-10 12:04:09,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 12:04:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2018-09-10 12:04:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 2747. [2018-09-10 12:04:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-09-10 12:04:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 4190 transitions. [2018-09-10 12:04:09,874 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 4190 transitions. Word has length 191 [2018-09-10 12:04:09,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:09,875 INFO L480 AbstractCegarLoop]: Abstraction has 2747 states and 4190 transitions. [2018-09-10 12:04:09,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 12:04:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4190 transitions. [2018-09-10 12:04:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-09-10 12:04:09,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:09,887 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:04:09,887 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1900671332, now seen corresponding path program 1 times [2018-09-10 12:04:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:09,889 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:10,463 WARN L175 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 12:04:11,056 WARN L175 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-10 12:04:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 311 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:11,648 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:11,648 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 12:04:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:11,657 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:11,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-09-10 12:04:12,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 150 proven. 148 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 12:04:13,013 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:04:13,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 5] total 18 [2018-09-10 12:04:13,013 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:13,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 12:04:13,014 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 12:04:13,014 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-09-10 12:04:13,015 INFO L87 Difference]: Start difference. First operand 2747 states and 4190 transitions. Second operand 5 states. [2018-09-10 12:04:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:17,268 INFO L93 Difference]: Finished difference Result 9874 states and 15249 transitions. [2018-09-10 12:04:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 12:04:17,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 325 [2018-09-10 12:04:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:17,312 INFO L225 Difference]: With dead ends: 9874 [2018-09-10 12:04:17,312 INFO L226 Difference]: Without dead ends: 7133 [2018-09-10 12:04:17,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 644 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-09-10 12:04:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2018-09-10 12:04:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 7085. [2018-09-10 12:04:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-09-10 12:04:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 10328 transitions. [2018-09-10 12:04:17,510 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 10328 transitions. Word has length 325 [2018-09-10 12:04:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:17,510 INFO L480 AbstractCegarLoop]: Abstraction has 7085 states and 10328 transitions. [2018-09-10 12:04:17,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 12:04:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 10328 transitions. [2018-09-10 12:04:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-09-10 12:04:17,530 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:17,530 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:04:17,531 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash -423730612, now seen corresponding path program 1 times [2018-09-10 12:04:17,531 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:17,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:17,533 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:18,218 WARN L175 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 12:04:18,756 WARN L175 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-10 12:04:18,943 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-09-10 12:04:19,111 WARN L175 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-10 12:04:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 311 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 12:04:19,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:19,431 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-09-10 12:04:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:19,445 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:19,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-09-10 12:04:20,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:20,497 WARN L175 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-09-10 12:04:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 150 proven. 148 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 12:04:21,039 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-10 12:04:21,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 6] total 20 [2018-09-10 12:04:21,040 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 12:04:21,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 12:04:21,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 12:04:21,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-09-10 12:04:21,041 INFO L87 Difference]: Start difference. First operand 7085 states and 10328 transitions. Second operand 6 states. [2018-09-10 12:04:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:23,913 INFO L93 Difference]: Finished difference Result 15450 states and 22303 transitions. [2018-09-10 12:04:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 12:04:23,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-09-10 12:04:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:23,957 INFO L225 Difference]: With dead ends: 15450 [2018-09-10 12:04:23,957 INFO L226 Difference]: Without dead ends: 8371 [2018-09-10 12:04:23,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 692 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-09-10 12:04:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2018-09-10 12:04:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 8327. [2018-09-10 12:04:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8327 states. [2018-09-10 12:04:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 11888 transitions. [2018-09-10 12:04:24,159 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 11888 transitions. Word has length 349 [2018-09-10 12:04:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:24,159 INFO L480 AbstractCegarLoop]: Abstraction has 8327 states and 11888 transitions. [2018-09-10 12:04:24,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 12:04:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11888 transitions. [2018-09-10 12:04:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-09-10 12:04:24,178 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:24,179 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-10 12:04:24,179 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash -807438210, now seen corresponding path program 1 times [2018-09-10 12:04:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:24,181 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 238 proven. 83 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-10 12:04:24,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:24,684 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:24,693 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:24,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-10 12:04:24,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 238 proven. 83 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-10 12:04:25,401 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:25,401 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:25,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:25,418 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:25,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 350 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-10 12:04:25,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 238 proven. 83 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-10 12:04:26,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:26,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 14 [2018-09-10 12:04:26,125 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:26,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 12:04:26,126 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 12:04:26,126 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-09-10 12:04:26,126 INFO L87 Difference]: Start difference. First operand 8327 states and 11888 transitions. Second operand 9 states. [2018-09-10 12:04:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:29,301 INFO L93 Difference]: Finished difference Result 18834 states and 30267 transitions. [2018-09-10 12:04:29,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-10 12:04:29,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 367 [2018-09-10 12:04:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:29,364 INFO L225 Difference]: With dead ends: 18834 [2018-09-10 12:04:29,367 INFO L226 Difference]: Without dead ends: 9492 [2018-09-10 12:04:29,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1484 GetRequests, 1462 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-09-10 12:04:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9492 states. [2018-09-10 12:04:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9492 to 8574. [2018-09-10 12:04:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8574 states. [2018-09-10 12:04:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 11756 transitions. [2018-09-10 12:04:29,673 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 11756 transitions. Word has length 367 [2018-09-10 12:04:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:29,674 INFO L480 AbstractCegarLoop]: Abstraction has 8574 states and 11756 transitions. [2018-09-10 12:04:29,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 12:04:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 11756 transitions. [2018-09-10 12:04:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-09-10 12:04:29,687 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:29,688 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:29,688 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1041365572, now seen corresponding path program 1 times [2018-09-10 12:04:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:29,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:29,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:29,690 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:30,155 WARN L175 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-10 12:04:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 417 proven. 214 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 12:04:30,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:30,561 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:30,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:30,570 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:30,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 540 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-09-10 12:04:30,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 359 proven. 73 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-09-10 12:04:31,428 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:31,428 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:31,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:31,443 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:31,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 536 proven. 6 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-09-10 12:04:31,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:32,124 WARN L175 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-10 12:04:32,337 WARN L175 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-10 12:04:32,851 WARN L175 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-09-10 12:04:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 359 proven. 73 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-09-10 12:04:33,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:33,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5, 5, 5] total 16 [2018-09-10 12:04:33,159 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:33,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-10 12:04:33,161 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-10 12:04:33,161 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:04:33,161 INFO L87 Difference]: Start difference. First operand 8574 states and 11756 transitions. Second operand 14 states. [2018-09-10 12:04:38,409 WARN L175 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-09-10 12:04:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:40,448 INFO L93 Difference]: Finished difference Result 19111 states and 26951 transitions. [2018-09-10 12:04:40,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-10 12:04:40,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 436 [2018-09-10 12:04:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:40,486 INFO L225 Difference]: With dead ends: 19111 [2018-09-10 12:04:40,487 INFO L226 Difference]: Without dead ends: 10041 [2018-09-10 12:04:40,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1814 GetRequests, 1767 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=445, Invalid=1717, Unknown=0, NotChecked=0, Total=2162 [2018-09-10 12:04:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2018-09-10 12:04:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 9198. [2018-09-10 12:04:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9198 states. [2018-09-10 12:04:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9198 states to 9198 states and 10894 transitions. [2018-09-10 12:04:40,708 INFO L78 Accepts]: Start accepts. Automaton has 9198 states and 10894 transitions. Word has length 436 [2018-09-10 12:04:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:40,709 INFO L480 AbstractCegarLoop]: Abstraction has 9198 states and 10894 transitions. [2018-09-10 12:04:40,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-10 12:04:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9198 states and 10894 transitions. [2018-09-10 12:04:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-09-10 12:04:40,728 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:40,729 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:04:40,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1688017425, now seen corresponding path program 1 times [2018-09-10 12:04:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:40,733 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 489 proven. 160 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-09-10 12:04:41,717 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:41,718 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:41,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:41,727 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:41,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 456 proven. 2 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-09-10 12:04:42,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 456 proven. 2 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-09-10 12:04:42,750 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:42,751 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:42,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:42,766 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:43,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 302 proven. 156 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-09-10 12:04:43,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 221 proven. 237 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-09-10 12:04:44,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:44,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 8, 8] total 16 [2018-09-10 12:04:44,178 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:44,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 12:04:44,181 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 12:04:44,181 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-09-10 12:04:44,181 INFO L87 Difference]: Start difference. First operand 9198 states and 10894 transitions. Second operand 13 states. [2018-09-10 12:04:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:04:47,534 INFO L93 Difference]: Finished difference Result 18831 states and 23228 transitions. [2018-09-10 12:04:47,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-10 12:04:47,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 447 [2018-09-10 12:04:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:04:47,576 INFO L225 Difference]: With dead ends: 18831 [2018-09-10 12:04:47,576 INFO L226 Difference]: Without dead ends: 9435 [2018-09-10 12:04:47,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1818 GetRequests, 1777 SyntacticMatches, 17 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2018-09-10 12:04:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9435 states. [2018-09-10 12:04:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9435 to 8733. [2018-09-10 12:04:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8733 states. [2018-09-10 12:04:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8733 states to 8733 states and 10107 transitions. [2018-09-10 12:04:47,791 INFO L78 Accepts]: Start accepts. Automaton has 8733 states and 10107 transitions. Word has length 447 [2018-09-10 12:04:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:04:47,792 INFO L480 AbstractCegarLoop]: Abstraction has 8733 states and 10107 transitions. [2018-09-10 12:04:47,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 12:04:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8733 states and 10107 transitions. [2018-09-10 12:04:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-09-10 12:04:47,802 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:04:47,803 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-10 12:04:47,803 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:04:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 192665076, now seen corresponding path program 1 times [2018-09-10 12:04:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:04:47,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:47,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:04:47,805 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:04:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:48,336 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:04:48,533 WARN L175 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-10 12:04:48,765 WARN L175 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-10 12:04:49,121 WARN L175 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-10 12:04:49,416 WARN L175 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-10 12:04:49,681 WARN L175 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-09-10 12:04:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 319 proven. 298 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 12:04:50,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:50,376 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:04:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:50,384 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:50,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 523 proven. 2 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-09-10 12:04:50,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 211 proven. 406 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 12:04:51,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:04:51,748 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:04:51,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:04:51,764 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:04:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:04:52,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:04:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 500 proven. 25 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-09-10 12:04:52,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:04:53,227 WARN L175 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-09-10 12:04:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 213 proven. 404 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-10 12:04:54,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:04:54,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8, 10, 11] total 40 [2018-09-10 12:04:54,681 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:04:54,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-10 12:04:54,682 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-10 12:04:54,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2018-09-10 12:04:54,683 INFO L87 Difference]: Start difference. First operand 8733 states and 10107 transitions. Second operand 19 states. [2018-09-10 12:04:57,225 WARN L175 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-09-10 12:04:58,079 WARN L175 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2018-09-10 12:05:00,460 WARN L175 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-09-10 12:05:01,211 WARN L175 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-09-10 12:05:01,526 WARN L175 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-09-10 12:05:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:04,186 INFO L93 Difference]: Finished difference Result 18692 states and 21874 transitions. [2018-09-10 12:05:04,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-10 12:05:04,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 460 [2018-09-10 12:05:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:04,211 INFO L225 Difference]: With dead ends: 18692 [2018-09-10 12:05:04,211 INFO L226 Difference]: Without dead ends: 10148 [2018-09-10 12:05:04,233 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1909 GetRequests, 1840 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=844, Invalid=3848, Unknown=0, NotChecked=0, Total=4692 [2018-09-10 12:05:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10148 states. [2018-09-10 12:05:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10148 to 9564. [2018-09-10 12:05:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9564 states. [2018-09-10 12:05:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 11005 transitions. [2018-09-10 12:05:04,395 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 11005 transitions. Word has length 460 [2018-09-10 12:05:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:04,396 INFO L480 AbstractCegarLoop]: Abstraction has 9564 states and 11005 transitions. [2018-09-10 12:05:04,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-10 12:05:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 11005 transitions. [2018-09-10 12:05:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-09-10 12:05:04,406 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:04,406 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 12:05:04,407 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash 129380070, now seen corresponding path program 2 times [2018-09-10 12:05:04,407 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:04,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:04,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:04,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:04,409 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:05,175 WARN L175 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-10 12:05:05,299 WARN L175 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-09-10 12:05:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 646 proven. 229 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-09-10 12:05:05,752 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:05,752 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:05:05,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 12:05:05,760 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 12:05:05,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 12:05:05,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 12:05:05,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 751 proven. 2 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-09-10 12:05:06,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 491 proven. 73 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-09-10 12:05:06,890 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:06,891 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:05:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 12:05:06,906 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 12:05:07,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 12:05:07,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 12:05:07,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 577 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 12:05:07,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:07,978 WARN L175 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-09-10 12:05:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 254 proven. 331 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-09-10 12:05:08,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:05:08,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5, 8, 8] total 28 [2018-09-10 12:05:08,856 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:05:08,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-10 12:05:08,857 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-10 12:05:08,858 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-09-10 12:05:08,858 INFO L87 Difference]: Start difference. First operand 9564 states and 11005 transitions. Second operand 17 states. [2018-09-10 12:05:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:18,217 INFO L93 Difference]: Finished difference Result 20965 states and 25635 transitions. [2018-09-10 12:05:18,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-10 12:05:18,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 547 [2018-09-10 12:05:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:18,252 INFO L225 Difference]: With dead ends: 20965 [2018-09-10 12:05:18,252 INFO L226 Difference]: Without dead ends: 10690 [2018-09-10 12:05:18,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2263 GetRequests, 2192 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=834, Invalid=3456, Unknown=0, NotChecked=0, Total=4290 [2018-09-10 12:05:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10690 states. [2018-09-10 12:05:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10690 to 9798. [2018-09-10 12:05:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9798 states. [2018-09-10 12:05:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 11052 transitions. [2018-09-10 12:05:18,494 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 11052 transitions. Word has length 547 [2018-09-10 12:05:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:18,495 INFO L480 AbstractCegarLoop]: Abstraction has 9798 states and 11052 transitions. [2018-09-10 12:05:18,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-10 12:05:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 11052 transitions. [2018-09-10 12:05:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2018-09-10 12:05:18,512 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 12:05:18,513 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-09-10 12:05:18,513 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 12:05:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1927365555, now seen corresponding path program 1 times [2018-09-10 12:05:18,514 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 12:05:18,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:18,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 12:05:18,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 12:05:18,515 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 12:05:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 608 proven. 83 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-09-10 12:05:19,384 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:19,384 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 12:05:19,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:19,393 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:19,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 878 proven. 2 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-09-10 12:05:20,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 608 proven. 83 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-09-10 12:05:20,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 12:05:20,554 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 12:05:20,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 12:05:20,570 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 12:05:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 12:05:21,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 12:05:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 878 proven. 2 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-09-10 12:05:21,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 12:05:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 608 proven. 83 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-09-10 12:05:21,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 12:05:21,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 9 [2018-09-10 12:05:21,475 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 12:05:21,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 12:05:21,476 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 12:05:21,476 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 12:05:21,476 INFO L87 Difference]: Start difference. First operand 9798 states and 11052 transitions. Second operand 7 states. [2018-09-10 12:05:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 12:05:23,656 INFO L93 Difference]: Finished difference Result 26860 states and 35133 transitions. [2018-09-10 12:05:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 12:05:23,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 660 [2018-09-10 12:05:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 12:05:23,658 INFO L225 Difference]: With dead ends: 26860 [2018-09-10 12:05:23,658 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 12:05:23,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2656 GetRequests, 2641 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-09-10 12:05:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 12:05:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 12:05:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 12:05:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 12:05:23,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 660 [2018-09-10 12:05:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 12:05:23,879 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 12:05:23,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 12:05:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 12:05:23,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 12:05:23,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 12:05:23,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:23,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:23,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:23,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:24,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:25,794 WARN L175 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 468 DAG size of output: 391 [2018-09-10 12:05:25,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:26,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-10 12:05:27,249 WARN L175 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 468 DAG size of output: 391 [2018-09-10 12:05:27,475 WARN L175 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2018-09-10 12:05:28,987 WARN L175 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 245 DAG size of output: 46 [2018-09-10 12:05:34,181 WARN L175 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 377 DAG size of output: 47 [2018-09-10 12:05:37,615 WARN L175 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 377 DAG size of output: 47 [2018-09-10 12:05:37,618 INFO L426 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-09-10 12:05:37,618 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-09-10 12:05:37,618 INFO L426 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,618 INFO L426 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,618 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-09-10 12:05:37,619 INFO L426 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-10 12:05:37,620 INFO L426 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,621 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,622 INFO L426 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-09-10 12:05:37,623 INFO L426 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-09-10 12:05:37,624 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-10 12:05:37,625 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-09-10 12:05:37,626 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-09-10 12:05:37,627 INFO L426 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-09-10 12:05:37,628 INFO L426 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-09-10 12:05:37,629 INFO L426 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-09-10 12:05:37,629 INFO L426 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,629 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,629 INFO L426 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,629 INFO L426 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-09-10 12:05:37,629 INFO L422 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse6 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)) (.cse7 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|)) (.cse8 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (.cse5 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|))) (let ((.cse2 (and .cse6 .cse7 .cse8 .cse5)) (.cse4 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1))) (.cse0 (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49))) (.cse1 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 5))) (.cse3 (and .cse5 .cse6 .cse7 .cse8))) (and (or (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 2) .cse0 .cse1 .cse2) (or .cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 10) .cse4) (or .cse2 (< 11 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) .cse4) (or .cse3 .cse1 (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7))) (or .cse2 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 6) .cse4) (or (< 7 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) .cse0 .cse1 .cse3)))) [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,630 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-09-10 12:05:37,631 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,632 INFO L426 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-09-10 12:05:37,633 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,634 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-10 12:05:37,635 INFO L426 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-09-10 12:05:37,636 INFO L426 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,637 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-09-10 12:05:37,638 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|)) [2018-09-10 12:05:37,639 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7) (<= (+ ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 49) 0) (= 8 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) [2018-09-10 12:05:37,639 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 12:05:37,639 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (and (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)|) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)|) (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)|)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1))) [2018-09-10 12:05:37,639 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-09-10 12:05:37,639 INFO L422 ceAbstractionStarter]: At program point L888(line 888) 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__a12~0 49) 0)) (.cse0 (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0))) (or (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 2)) .cse1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7)) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (and .cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10))) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7) .cse0 .cse1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)) (and .cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and .cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (and .cse2 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0))))) [2018-09-10 12:05:37,640 INFO L426 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-09-10 12:05:37,640 INFO L426 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-09-10 12:05:37,640 INFO L426 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-09-10 12:05:37,640 INFO L422 ceAbstractionStarter]: At program point L880-3(lines 880 889) 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__a12~0 49) 0)) (.cse0 (= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)) (.cse2 (= 1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0))) (or (and .cse0 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0 2)) .cse1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0)| 7)) (< 0 (+ |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0)| 49)) (and .cse2 (not (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 10))) (and (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7) .cse0 .cse1) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24~0)| 1)) (and .cse0 (= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21~0 7)) (not (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0)| 8)) (and .cse2 (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12~0 11)) (and .cse2 (not (= 6 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15~0))))) [2018-09-10 12:05:37,640 INFO L426 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-09-10 12:05:37,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 12:05:37 BoogieIcfgContainer [2018-09-10 12:05:37,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 12:05:37,661 INFO L168 Benchmark]: Toolchain (without parser) took 109681.28 ms. Allocated memory was 1.6 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-10 12:05:37,662 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 12:05:37,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.39 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:37,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.43 ms. Allocated memory is still 1.6 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-09-10 12:05:37,664 INFO L168 Benchmark]: Boogie Preprocessor took 283.49 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -889.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:37,665 INFO L168 Benchmark]: RCFGBuilder took 3844.44 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: 143.5 MB). Peak memory consumption was 143.5 MB. Max. memory is 7.1 GB. [2018-09-10 12:05:37,666 INFO L168 Benchmark]: TraceAbstraction took 104625.27 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-10 12:05:37,670 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.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.39 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 142.43 ms. Allocated memory is still 1.6 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 283.49 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -889.6 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3844.44 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: 143.5 MB). Peak memory consumption was 143.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104625.27 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((5 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 == 2)) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21) == 7)) || 0 < \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12) + 49) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 10))) || ((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 <= 7 && 5 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 + 49 <= 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24) == 1)) || (5 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a21 == 7)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15) == 8)) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a12 <= 11)) || (1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a24 && !(6 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__a15)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 104.5s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 57.5s AutomataDifference, 0.0s DeadEndRemovalTime, 13.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1155 SDtfs, 19229 SDslu, 2439 SDs, 0 SdLazy, 32069 SolverSat, 5183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13357 GetRequests, 13025 SyntacticMatches, 43 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3630 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9798occurred in iteration=11, 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: 1.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 4702 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 350 PreInvPairs, 640 NumberOfFragments, 351 HoareAnnotationTreeSize, 350 FomulaSimplifications, 222164 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 63640 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 10627 NumberOfCodeBlocks, 10627 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17095 ConstructedInterpolants, 0 QuantifiedInterpolants, 42089536 SizeOfPredicates, 50 NumberOfNonLiveVariables, 10073 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 40 InterpolantComputations, 6 PerfectInterpolantSequences, 23400/27047 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/Problem14_label38_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_12-05-37-688.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label38_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_12-05-37-688.csv Received shutdown request...