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/Problem13_label20_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 17:31:13,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 17:31:13,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 17:31:13,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 17:31:13,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 17:31:13,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 17:31:13,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 17:31:13,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 17:31:13,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 17:31:13,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 17:31:13,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 17:31:13,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 17:31:13,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 17:31:13,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 17:31:13,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 17:31:13,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 17:31:13,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 17:31:13,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 17:31:13,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 17:31:13,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 17:31:13,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 17:31:13,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 17:31:13,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 17:31:13,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 17:31:13,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 17:31:13,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 17:31:13,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 17:31:13,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 17:31:13,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 17:31:13,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 17:31:13,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 17:31:13,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 17:31:13,074 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 17:31:13,074 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 17:31:13,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 17:31:13,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 17:31:13,076 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-14 17:31:13,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 17:31:13,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 17:31:13,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 17:31:13,099 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 17:31:13,100 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 17:31:13,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 17:31:13,100 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 17:31:13,100 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 17:31:13,101 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 17:31:13,101 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 17:31:13,101 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 17:31:13,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 17:31:13,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 17:31:13,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 17:31:13,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 17:31:13,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 17:31:13,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 17:31:13,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 17:31:13,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 17:31:13,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 17:31:13,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 17:31:13,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 17:31:13,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 17:31:13,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:31:13,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 17:31:13,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 17:31:13,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 17:31:13,105 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 17:31:13,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 17:31:13,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 17:31:13,105 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 17:31:13,105 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 17:31:13,106 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 17:31:13,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 17:31:13,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 17:31:13,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 17:31:13,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 17:31:13,174 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 17:31:13,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label20_true-unreach-call.c [2018-09-14 17:31:13,552 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d424b56a0/4a2984365474416bb9bf79ca5dcc5844/FLAG80415ed14 [2018-09-14 17:31:14,073 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 17:31:14,074 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label20_true-unreach-call.c [2018-09-14 17:31:14,123 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d424b56a0/4a2984365474416bb9bf79ca5dcc5844/FLAG80415ed14 [2018-09-14 17:31:14,142 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d424b56a0/4a2984365474416bb9bf79ca5dcc5844 [2018-09-14 17:31:14,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 17:31:14,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 17:31:14,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 17:31:14,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 17:31:14,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 17:31:14,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:31:14" (1/1) ... [2018-09-14 17:31:14,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359f2bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:14, skipping insertion in model container [2018-09-14 17:31:14,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:31:14" (1/1) ... [2018-09-14 17:31:14,183 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 17:31:15,645 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:31:15,668 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 17:31:16,436 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:31:16,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16 WrapperNode [2018-09-14 17:31:16,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 17:31:16,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 17:31:16,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 17:31:16,782 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 17:31:16,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:16,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:17,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 17:31:17,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 17:31:17,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 17:31:17,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 17:31:17,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:17,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:18,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:18,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:18,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:18,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:18,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (1/1) ... [2018-09-14 17:31:18,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 17:31:18,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 17:31:18,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 17:31:18,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 17:31:18,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (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-14 17:31:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 17:31:18,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 17:31:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-14 17:31:18,472 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-14 17:31:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-14 17:31:18,473 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-14 17:31:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-14 17:31:18,473 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-14 17:31:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 17:31:18,473 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 17:31:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 17:31:18,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 17:31:18,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 17:31:18,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 17:31:29,585 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 17:31:29,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:31:29 BoogieIcfgContainer [2018-09-14 17:31:29,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 17:31:29,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 17:31:29,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 17:31:29,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 17:31:29,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 05:31:14" (1/3) ... [2018-09-14 17:31:29,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778234b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:31:29, skipping insertion in model container [2018-09-14 17:31:29,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:31:16" (2/3) ... [2018-09-14 17:31:29,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778234b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:31:29, skipping insertion in model container [2018-09-14 17:31:29,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:31:29" (3/3) ... [2018-09-14 17:31:29,594 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label20_true-unreach-call.c [2018-09-14 17:31:29,602 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 17:31:29,611 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 17:31:29,673 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 17:31:29,674 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 17:31:29,674 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 17:31:29,674 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 17:31:29,675 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 17:31:29,675 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 17:31:29,675 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 17:31:29,675 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 17:31:29,675 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 17:31:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-14 17:31:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-14 17:31:29,739 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:31:29,740 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, 1, 1, 1, 1, 1] [2018-09-14 17:31:29,742 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:31:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash -113256892, now seen corresponding path program 1 times [2018-09-14 17:31:29,751 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:31:29,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:31:29,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:31:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:31:29,805 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:31:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:31:30,284 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-14 17:31:30,287 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:31:30,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:31:30,287 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:31:30,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:31:30,309 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:31:30,310 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:31:30,313 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-09-14 17:31:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:31:44,470 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-09-14 17:31:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:31:44,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-09-14 17:31:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:31:44,512 INFO L225 Difference]: With dead ends: 3968 [2018-09-14 17:31:44,512 INFO L226 Difference]: Without dead ends: 2842 [2018-09-14 17:31:44,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-14 17:31:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-09-14 17:31:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-09-14 17:31:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-09-14 17:31:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-09-14 17:31:44,709 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 62 [2018-09-14 17:31:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:31:44,710 INFO L480 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-09-14 17:31:44,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:31:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-09-14 17:31:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-14 17:31:44,718 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:31:44,719 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, 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] [2018-09-14 17:31:44,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:31:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash 12905824, now seen corresponding path program 1 times [2018-09-14 17:31:44,719 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:31:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:31:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:31:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:31:44,721 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:31:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:31:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:31:45,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:31:45,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 17:31:45,084 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:31:45,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:31:45,087 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:31:45,087 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 17:31:45,087 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-09-14 17:31:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:31:58,413 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-09-14 17:31:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:31:58,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-09-14 17:31:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:31:58,447 INFO L225 Difference]: With dead ends: 5673 [2018-09-14 17:31:58,448 INFO L226 Difference]: Without dead ends: 3698 [2018-09-14 17:31:58,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:31:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-09-14 17:31:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-09-14 17:31:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-09-14 17:31:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-09-14 17:31:58,579 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 132 [2018-09-14 17:31:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:31:58,580 INFO L480 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-09-14 17:31:58,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:31:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-09-14 17:31:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-14 17:31:58,585 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:31:58,585 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, 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] [2018-09-14 17:31:58,586 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:31:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash -906091524, now seen corresponding path program 1 times [2018-09-14 17:31:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:31:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:31:58,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:31:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:31:58,588 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:31:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:31:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:31:58,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:31:58,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 17:31:58,923 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:31:58,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:31:58,925 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:31:58,925 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 17:31:58,925 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-09-14 17:32:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:32:16,160 INFO L93 Difference]: Finished difference Result 10963 states and 17865 transitions. [2018-09-14 17:32:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 17:32:16,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-09-14 17:32:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:32:16,206 INFO L225 Difference]: With dead ends: 10963 [2018-09-14 17:32:16,206 INFO L226 Difference]: Without dead ends: 7282 [2018-09-14 17:32:16,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:32:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2018-09-14 17:32:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7175. [2018-09-14 17:32:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-09-14 17:32:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 10520 transitions. [2018-09-14 17:32:16,401 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 10520 transitions. Word has length 134 [2018-09-14 17:32:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:32:16,402 INFO L480 AbstractCegarLoop]: Abstraction has 7175 states and 10520 transitions. [2018-09-14 17:32:16,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:32:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10520 transitions. [2018-09-14 17:32:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-14 17:32:16,406 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:32:16,407 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, 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] [2018-09-14 17:32:16,407 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:32:16,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1690050436, now seen corresponding path program 1 times [2018-09-14 17:32:16,407 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:32:16,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:16,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:16,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:16,409 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:32:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:32:16,586 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:32:16,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:32:16,586 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:32:16,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:32:16,587 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:32:16,587 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:32:16,588 INFO L87 Difference]: Start difference. First operand 7175 states and 10520 transitions. Second operand 3 states. [2018-09-14 17:32:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:32:22,706 INFO L93 Difference]: Finished difference Result 21003 states and 32063 transitions. [2018-09-14 17:32:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:32:22,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-09-14 17:32:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:32:22,796 INFO L225 Difference]: With dead ends: 21003 [2018-09-14 17:32:22,796 INFO L226 Difference]: Without dead ends: 13834 [2018-09-14 17:32:22,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:32:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13834 states. [2018-09-14 17:32:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13834 to 13825. [2018-09-14 17:32:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2018-09-14 17:32:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 19394 transitions. [2018-09-14 17:32:23,284 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 19394 transitions. Word has length 178 [2018-09-14 17:32:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:32:23,284 INFO L480 AbstractCegarLoop]: Abstraction has 13825 states and 19394 transitions. [2018-09-14 17:32:23,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:32:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 19394 transitions. [2018-09-14 17:32:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-14 17:32:23,290 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:32:23,291 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, 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-14 17:32:23,291 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:32:23,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1829231100, now seen corresponding path program 1 times [2018-09-14 17:32:23,291 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:32:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:23,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:23,293 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:32:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:32:23,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:32:23,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:32:23,519 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:32:23,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:32:23,520 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:32:23,520 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:32:23,521 INFO L87 Difference]: Start difference. First operand 13825 states and 19394 transitions. Second operand 4 states. [2018-09-14 17:32:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:32:32,614 INFO L93 Difference]: Finished difference Result 31681 states and 44253 transitions. [2018-09-14 17:32:32,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:32:32,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-09-14 17:32:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:32:32,665 INFO L225 Difference]: With dead ends: 31681 [2018-09-14 17:32:32,666 INFO L226 Difference]: Without dead ends: 17862 [2018-09-14 17:32:32,713 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-14 17:32:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17862 states. [2018-09-14 17:32:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17862 to 17861. [2018-09-14 17:32:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17861 states. [2018-09-14 17:32:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17861 states to 17861 states and 22138 transitions. [2018-09-14 17:32:33,022 INFO L78 Accepts]: Start accepts. Automaton has 17861 states and 22138 transitions. Word has length 183 [2018-09-14 17:32:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:32:33,023 INFO L480 AbstractCegarLoop]: Abstraction has 17861 states and 22138 transitions. [2018-09-14 17:32:33,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:32:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 17861 states and 22138 transitions. [2018-09-14 17:32:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-14 17:32:33,032 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:32:33,032 INFO L376 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:32:33,032 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:32:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1374780002, now seen corresponding path program 1 times [2018-09-14 17:32:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:32:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:33,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:33,034 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:32:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:33,364 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:32:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:32:33,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:32:33,712 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-14 17:32:33,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:33,728 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:32:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:33,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:32:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-14 17:32:34,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:32:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-14 17:32:34,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:32:34,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 8 [2018-09-14 17:32:34,495 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:32:34,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:32:34,495 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:32:34,498 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:32:34,498 INFO L87 Difference]: Start difference. First operand 17861 states and 22138 transitions. Second operand 3 states. [2018-09-14 17:32:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:32:43,966 INFO L93 Difference]: Finished difference Result 43070 states and 53960 transitions. [2018-09-14 17:32:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:32:43,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-09-14 17:32:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:32:44,075 INFO L225 Difference]: With dead ends: 43070 [2018-09-14 17:32:44,075 INFO L226 Difference]: Without dead ends: 25215 [2018-09-14 17:32:44,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:32:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25215 states. [2018-09-14 17:32:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25215 to 25215. [2018-09-14 17:32:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25215 states. [2018-09-14 17:32:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25215 states to 25215 states and 30414 transitions. [2018-09-14 17:32:44,974 INFO L78 Accepts]: Start accepts. Automaton has 25215 states and 30414 transitions. Word has length 253 [2018-09-14 17:32:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:32:44,974 INFO L480 AbstractCegarLoop]: Abstraction has 25215 states and 30414 transitions. [2018-09-14 17:32:44,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:32:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25215 states and 30414 transitions. [2018-09-14 17:32:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-14 17:32:44,983 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:32:44,984 INFO L376 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:32:44,984 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:32:44,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2059150954, now seen corresponding path program 1 times [2018-09-14 17:32:44,984 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:32:44,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:44,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:44,986 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:32:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:45,367 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:32:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 110 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:32:45,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:32:45,812 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-14 17:32:45,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:45,833 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:32:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:45,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:32:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-14 17:32:46,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:32:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 110 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 17:32:47,407 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:32:47,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 17:32:47,408 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:32:47,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:32:47,408 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:32:47,409 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:32:47,409 INFO L87 Difference]: Start difference. First operand 25215 states and 30414 transitions. Second operand 5 states. [2018-09-14 17:32:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:32:58,277 INFO L93 Difference]: Finished difference Result 70108 states and 88332 transitions. [2018-09-14 17:32:58,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 17:32:58,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 268 [2018-09-14 17:32:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:32:58,400 INFO L225 Difference]: With dead ends: 70108 [2018-09-14 17:32:58,401 INFO L226 Difference]: Without dead ends: 44899 [2018-09-14 17:32:58,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 531 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-14 17:32:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44899 states. [2018-09-14 17:32:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44899 to 41393. [2018-09-14 17:32:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41393 states. [2018-09-14 17:32:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41393 states to 41393 states and 49555 transitions. [2018-09-14 17:32:59,155 INFO L78 Accepts]: Start accepts. Automaton has 41393 states and 49555 transitions. Word has length 268 [2018-09-14 17:32:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:32:59,155 INFO L480 AbstractCegarLoop]: Abstraction has 41393 states and 49555 transitions. [2018-09-14 17:32:59,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 17:32:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 41393 states and 49555 transitions. [2018-09-14 17:32:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-14 17:32:59,173 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:32:59,173 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:32:59,174 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:32:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1523071822, now seen corresponding path program 1 times [2018-09-14 17:32:59,174 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:32:59,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:59,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:59,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:32:59,175 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:32:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 247 proven. 69 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-14 17:32:59,660 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:32:59,661 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-14 17:32:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:32:59,669 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:32:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:32:59,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:33:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-14 17:33:00,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:33:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 247 proven. 69 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-14 17:33:00,323 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:33:00,323 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-14 17:33:00,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:33:00,340 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:33:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:33:00,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:33:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-14 17:33:00,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:33:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 247 proven. 69 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-14 17:33:01,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:33:01,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:33:01,226 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:33:01,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:33:01,227 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:33:01,227 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:33:01,227 INFO L87 Difference]: Start difference. First operand 41393 states and 49555 transitions. Second operand 9 states. [2018-09-14 17:33:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:33:18,753 INFO L93 Difference]: Finished difference Result 117889 states and 160848 transitions. [2018-09-14 17:33:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-14 17:33:18,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 332 [2018-09-14 17:33:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:33:19,048 INFO L225 Difference]: With dead ends: 117889 [2018-09-14 17:33:19,048 INFO L226 Difference]: Without dead ends: 74585 [2018-09-14 17:33:19,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1350 GetRequests, 1326 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-09-14 17:33:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74585 states. [2018-09-14 17:33:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74585 to 74218. [2018-09-14 17:33:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74218 states. [2018-09-14 17:33:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74218 states to 74218 states and 93460 transitions. [2018-09-14 17:33:20,657 INFO L78 Accepts]: Start accepts. Automaton has 74218 states and 93460 transitions. Word has length 332 [2018-09-14 17:33:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:33:20,657 INFO L480 AbstractCegarLoop]: Abstraction has 74218 states and 93460 transitions. [2018-09-14 17:33:20,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:33:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 74218 states and 93460 transitions. [2018-09-14 17:33:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-09-14 17:33:20,690 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:33:20,690 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 17:33:20,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:33:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 822670100, now seen corresponding path program 1 times [2018-09-14 17:33:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:33:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:33:20,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:33:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:33:20,693 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:33:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:33:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-09-14 17:33:21,419 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:33:21,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:33:21,420 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:33:21,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:33:21,421 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:33:21,421 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:33:21,421 INFO L87 Difference]: Start difference. First operand 74218 states and 93460 transitions. Second operand 4 states. [2018-09-14 17:33:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:33:32,441 INFO L93 Difference]: Finished difference Result 164031 states and 218142 transitions. [2018-09-14 17:33:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:33:32,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 343 [2018-09-14 17:33:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:33:32,761 INFO L225 Difference]: With dead ends: 164031 [2018-09-14 17:33:32,762 INFO L226 Difference]: Without dead ends: 88720 [2018-09-14 17:33:32,995 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-14 17:33:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88720 states. [2018-09-14 17:33:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88720 to 88688. [2018-09-14 17:33:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88688 states. [2018-09-14 17:33:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88688 states to 88688 states and 109460 transitions. [2018-09-14 17:33:35,035 INFO L78 Accepts]: Start accepts. Automaton has 88688 states and 109460 transitions. Word has length 343 [2018-09-14 17:33:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:33:35,036 INFO L480 AbstractCegarLoop]: Abstraction has 88688 states and 109460 transitions. [2018-09-14 17:33:35,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:33:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 88688 states and 109460 transitions. [2018-09-14 17:33:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-09-14 17:33:35,069 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:33:35,069 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, 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, 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] [2018-09-14 17:33:35,069 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:33:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash -32051902, now seen corresponding path program 1 times [2018-09-14 17:33:35,070 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:33:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:33:35,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:33:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:33:35,071 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:33:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:33:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-14 17:33:35,406 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:33:35,406 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-14 17:33:35,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:33:35,414 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:33:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:33:35,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:33:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-14 17:33:35,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:33:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-14 17:33:35,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:33:35,832 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-14 17:33:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:33:35,852 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:33:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:33:36,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:33:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-14 17:33:36,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:33:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 326 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-14 17:33:36,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:33:36,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-14 17:33:36,377 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:33:36,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:33:36,378 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:33:36,378 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 17:33:36,379 INFO L87 Difference]: Start difference. First operand 88688 states and 109460 transitions. Second operand 9 states. [2018-09-14 17:33:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:33:57,479 INFO L93 Difference]: Finished difference Result 179857 states and 222980 transitions. [2018-09-14 17:33:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 17:33:57,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 372 [2018-09-14 17:33:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:33:58,498 INFO L225 Difference]: With dead ends: 179857 [2018-09-14 17:33:58,498 INFO L226 Difference]: Without dead ends: 90904 [2018-09-14 17:33:58,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1484 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-14 17:33:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90904 states. [2018-09-14 17:33:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90904 to 90584. [2018-09-14 17:33:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90584 states. [2018-09-14 17:33:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90584 states to 90584 states and 104260 transitions. [2018-09-14 17:33:59,918 INFO L78 Accepts]: Start accepts. Automaton has 90584 states and 104260 transitions. Word has length 372 [2018-09-14 17:33:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:33:59,918 INFO L480 AbstractCegarLoop]: Abstraction has 90584 states and 104260 transitions. [2018-09-14 17:33:59,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:33:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 90584 states and 104260 transitions. [2018-09-14 17:33:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-09-14 17:33:59,939 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:33:59,940 INFO L376 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:33:59,940 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:33:59,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1971180152, now seen corresponding path program 1 times [2018-09-14 17:33:59,940 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:33:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:33:59,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:33:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:33:59,941 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:33:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:34:00,310 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 17:34:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:34:00,836 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:34:00,837 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-14 17:34:00,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:34:00,854 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:34:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:34:00,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:34:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:34:01,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:34:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:34:01,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:34:01,792 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-14 17:34:01,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:34:01,809 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:34:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:34:02,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:34:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:34:02,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:34:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:34:03,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:34:03,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-14 17:34:03,164 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:34:03,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:34:03,165 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:34:03,165 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-14 17:34:03,166 INFO L87 Difference]: Start difference. First operand 90584 states and 104260 transitions. Second operand 9 states. [2018-09-14 17:34:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:34:14,556 INFO L93 Difference]: Finished difference Result 187059 states and 218244 transitions. [2018-09-14 17:34:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:34:14,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 405 [2018-09-14 17:34:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:34:14,808 INFO L225 Difference]: With dead ends: 187059 [2018-09-14 17:34:14,808 INFO L226 Difference]: Without dead ends: 97297 [2018-09-14 17:34:14,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1629 GetRequests, 1611 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-09-14 17:34:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97297 states. [2018-09-14 17:34:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97297 to 96222. [2018-09-14 17:34:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96222 states. [2018-09-14 17:34:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96222 states to 96222 states and 106097 transitions. [2018-09-14 17:34:17,003 INFO L78 Accepts]: Start accepts. Automaton has 96222 states and 106097 transitions. Word has length 405 [2018-09-14 17:34:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:34:17,004 INFO L480 AbstractCegarLoop]: Abstraction has 96222 states and 106097 transitions. [2018-09-14 17:34:17,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:34:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 96222 states and 106097 transitions. [2018-09-14 17:34:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-09-14 17:34:17,017 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:34:17,018 INFO L376 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:34:17,018 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:34:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 577177319, now seen corresponding path program 1 times [2018-09-14 17:34:17,018 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:34:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:34:17,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:34:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:34:17,020 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:34:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:34:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-09-14 17:34:17,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:34:17,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:34:17,348 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:34:17,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:34:17,349 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:34:17,349 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:34:17,349 INFO L87 Difference]: Start difference. First operand 96222 states and 106097 transitions. Second operand 4 states. [2018-09-14 17:34:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:34:39,452 INFO L93 Difference]: Finished difference Result 278379 states and 311553 transitions. [2018-09-14 17:34:39,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:34:39,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2018-09-14 17:34:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:34:39,821 INFO L225 Difference]: With dead ends: 278379 [2018-09-14 17:34:39,822 INFO L226 Difference]: Without dead ends: 182979 [2018-09-14 17:34:39,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:34:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182979 states. [2018-09-14 17:34:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182979 to 180162. [2018-09-14 17:34:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180162 states. [2018-09-14 17:34:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180162 states to 180162 states and 198501 transitions. [2018-09-14 17:34:42,949 INFO L78 Accepts]: Start accepts. Automaton has 180162 states and 198501 transitions. Word has length 409 [2018-09-14 17:34:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:34:42,950 INFO L480 AbstractCegarLoop]: Abstraction has 180162 states and 198501 transitions. [2018-09-14 17:34:42,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:34:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 180162 states and 198501 transitions. [2018-09-14 17:34:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-09-14 17:34:42,965 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:34:42,965 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-14 17:34:42,965 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:34:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1952964724, now seen corresponding path program 1 times [2018-09-14 17:34:42,966 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:34:42,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:34:42,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:34:42,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:34:42,967 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:34:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:34:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-09-14 17:34:43,357 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:34:43,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 17:34:43,358 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:34:43,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 17:34:43,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 17:34:43,358 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-14 17:34:43,359 INFO L87 Difference]: Start difference. First operand 180162 states and 198501 transitions. Second operand 5 states. Received shutdown request... [2018-09-14 17:35:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 17:35:04,634 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 17:35:04,639 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 17:35:04,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 05:35:04 BoogieIcfgContainer [2018-09-14 17:35:04,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 17:35:04,640 INFO L168 Benchmark]: Toolchain (without parser) took 230486.10 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-14 17:35:04,641 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 17:35:04,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2622.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 339.3 MB). Peak memory consumption was 339.3 MB. Max. memory is 7.1 GB. [2018-09-14 17:35:04,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 346.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-14 17:35:04,645 INFO L168 Benchmark]: Boogie Preprocessor took 1261.60 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-09-14 17:35:04,648 INFO L168 Benchmark]: RCFGBuilder took 11196.25 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 151.0 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 4.8 MB). Peak memory consumption was 744.5 MB. Max. memory is 7.1 GB. [2018-09-14 17:35:04,649 INFO L168 Benchmark]: TraceAbstraction took 215052.91 ms. Allocated memory was 2.7 GB in the beginning and 3.4 GB in the end (delta: 725.6 MB). Free memory was 2.3 GB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-14 17:35:04,658 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2622.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 339.3 MB). Peak memory consumption was 339.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 346.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1261.60 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11196.25 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 151.0 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 4.8 MB). Peak memory consumption was 744.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215052.91 ms. Allocated memory was 2.7 GB in the beginning and 3.4 GB in the end (delta: 725.6 MB). Free memory was 2.3 GB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 177). Cancelled while BasicCegarLoop was constructing difference of abstraction (180162states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (197793 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 214.9s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 188.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13269 SDtfs, 49421 SDslu, 6666 SDs, 0 SdLazy, 83343 SolverSat, 18286 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 154.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5590 GetRequests, 5481 SyntacticMatches, 16 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180162occurred in iteration=12, 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: 12.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 9106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 6222 NumberOfCodeBlocks, 6222 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 8932 ConstructedInterpolants, 0 QuantifiedInterpolants, 6828175 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4673 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 29 InterpolantComputations, 10 PerfectInterpolantSequences, 7411/7776 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label20_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_17-35-04-672.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label20_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_17-35-04-672.csv Completed graceful shutdown