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/Problem11_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 11:24:08,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 11:24:08,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 11:24:08,556 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 11:24:08,556 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 11:24:08,557 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 11:24:08,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 11:24:08,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 11:24:08,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 11:24:08,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 11:24:08,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 11:24:08,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 11:24:08,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 11:24:08,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 11:24:08,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 11:24:08,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 11:24:08,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 11:24:08,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 11:24:08,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 11:24:08,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 11:24:08,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 11:24:08,598 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 11:24:08,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 11:24:08,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 11:24:08,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 11:24:08,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 11:24:08,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 11:24:08,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 11:24:08,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 11:24:08,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 11:24:08,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 11:24:08,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 11:24:08,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 11:24:08,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 11:24:08,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 11:24:08,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 11:24:08,614 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-18 11:24:08,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 11:24:08,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 11:24:08,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 11:24:08,647 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 11:24:08,647 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 11:24:08,648 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 11:24:08,648 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 11:24:08,648 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 11:24:08,648 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 11:24:08,649 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 11:24:08,649 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 11:24:08,649 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 11:24:08,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 11:24:08,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 11:24:08,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 11:24:08,651 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 11:24:08,651 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 11:24:08,651 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 11:24:08,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 11:24:08,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 11:24:08,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 11:24:08,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 11:24:08,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 11:24:08,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 11:24:08,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 11:24:08,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 11:24:08,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 11:24:08,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 11:24:08,655 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 11:24:08,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 11:24:08,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 11:24:08,656 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 11:24:08,656 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 11:24:08,656 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 11:24:08,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 11:24:08,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 11:24:08,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 11:24:08,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 11:24:08,738 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 11:24:08,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c [2018-09-18 11:24:09,101 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309d5d266/726e9560fe9147b48f136dc65b02840b/FLAGba1dd052b [2018-09-18 11:24:09,419 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 11:24:09,422 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c [2018-09-18 11:24:09,440 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309d5d266/726e9560fe9147b48f136dc65b02840b/FLAGba1dd052b [2018-09-18 11:24:09,461 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309d5d266/726e9560fe9147b48f136dc65b02840b [2018-09-18 11:24:09,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 11:24:09,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 11:24:09,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 11:24:09,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 11:24:09,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 11:24:09,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 11:24:09" (1/1) ... [2018-09-18 11:24:09,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6b79aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:09, skipping insertion in model container [2018-09-18 11:24:09,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 11:24:09" (1/1) ... [2018-09-18 11:24:09,501 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 11:24:10,136 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 11:24:10,155 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 11:24:10,342 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 11:24:10,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10 WrapperNode [2018-09-18 11:24:10,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 11:24:10,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 11:24:10,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 11:24:10,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 11:24:10,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 11:24:10,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 11:24:10,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 11:24:10,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 11:24:10,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (1/1) ... [2018-09-18 11:24:10,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 11:24:10,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 11:24:10,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 11:24:10,996 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 11:24:10,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (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-18 11:24:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 11:24:11,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 11:24:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 11:24:11,066 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 11:24:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 11:24:11,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 11:24:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 11:24:11,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 11:24:15,139 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 11:24:15,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 11:24:15 BoogieIcfgContainer [2018-09-18 11:24:15,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 11:24:15,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 11:24:15,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 11:24:15,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 11:24:15,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 11:24:09" (1/3) ... [2018-09-18 11:24:15,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208a0760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 11:24:15, skipping insertion in model container [2018-09-18 11:24:15,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 11:24:10" (2/3) ... [2018-09-18 11:24:15,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208a0760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 11:24:15, skipping insertion in model container [2018-09-18 11:24:15,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 11:24:15" (3/3) ... [2018-09-18 11:24:15,148 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label41_true-unreach-call.c [2018-09-18 11:24:15,159 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 11:24:15,168 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 11:24:15,222 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 11:24:15,223 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 11:24:15,223 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 11:24:15,223 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 11:24:15,224 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 11:24:15,224 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 11:24:15,224 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 11:24:15,224 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 11:24:15,224 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 11:24:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-18 11:24:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-18 11:24:15,261 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:15,262 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] [2018-09-18 11:24:15,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash -146636772, now seen corresponding path program 1 times [2018-09-18 11:24:15,272 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:15,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:15,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:15,332 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:15,749 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 11:24:15,862 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-18 11:24:15,865 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:24:15,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 11:24:15,866 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:24:15,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:24:15,889 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:24:15,889 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:24:15,892 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-09-18 11:24:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:18,145 INFO L93 Difference]: Finished difference Result 782 states and 1372 transitions. [2018-09-18 11:24:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:24:18,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-18 11:24:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:18,169 INFO L225 Difference]: With dead ends: 782 [2018-09-18 11:24:18,169 INFO L226 Difference]: Without dead ends: 487 [2018-09-18 11:24:18,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:24:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-09-18 11:24:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2018-09-18 11:24:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-09-18 11:24:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 843 transitions. [2018-09-18 11:24:18,268 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 843 transitions. Word has length 28 [2018-09-18 11:24:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:18,269 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 843 transitions. [2018-09-18 11:24:18,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:24:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 843 transitions. [2018-09-18 11:24:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-18 11:24:18,275 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:18,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 11:24:18,276 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -425752825, now seen corresponding path program 1 times [2018-09-18 11:24:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:18,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:18,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:18,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:18,279 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:24:19,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:24:19,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-18 11:24:19,015 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:24:19,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 11:24:19,017 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 11:24:19,018 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-18 11:24:19,018 INFO L87 Difference]: Start difference. First operand 482 states and 843 transitions. Second operand 7 states. [2018-09-18 11:24:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:25,741 INFO L93 Difference]: Finished difference Result 1760 states and 3239 transitions. [2018-09-18 11:24:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-18 11:24:25,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-09-18 11:24:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:25,761 INFO L225 Difference]: With dead ends: 1760 [2018-09-18 11:24:25,761 INFO L226 Difference]: Without dead ends: 1284 [2018-09-18 11:24:25,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:24:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-09-18 11:24:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1037. [2018-09-18 11:24:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-09-18 11:24:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1685 transitions. [2018-09-18 11:24:25,847 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1685 transitions. Word has length 103 [2018-09-18 11:24:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:25,847 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1685 transitions. [2018-09-18 11:24:25,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 11:24:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1685 transitions. [2018-09-18 11:24:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-18 11:24:25,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:25,864 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:24:25,864 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1279135784, now seen corresponding path program 1 times [2018-09-18 11:24:25,866 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:25,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:25,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:25,868 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 11:24:26,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:26,157 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-18 11:24:26,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:26,170 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:24:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:26,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-18 11:24:26,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:26,923 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-18 11:24:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 11:24:27,431 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:24:27,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 11:24:27,432 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:24:27,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 11:24:27,433 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 11:24:27,435 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:24:27,436 INFO L87 Difference]: Start difference. First operand 1037 states and 1685 transitions. Second operand 5 states. [2018-09-18 11:24:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:33,913 INFO L93 Difference]: Finished difference Result 3395 states and 5619 transitions. [2018-09-18 11:24:33,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 11:24:33,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2018-09-18 11:24:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:33,935 INFO L225 Difference]: With dead ends: 3395 [2018-09-18 11:24:33,936 INFO L226 Difference]: Without dead ends: 2364 [2018-09-18 11:24:33,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-18 11:24:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2018-09-18 11:24:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2323. [2018-09-18 11:24:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2018-09-18 11:24:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3627 transitions. [2018-09-18 11:24:34,043 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3627 transitions. Word has length 176 [2018-09-18 11:24:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:34,044 INFO L480 AbstractCegarLoop]: Abstraction has 2323 states and 3627 transitions. [2018-09-18 11:24:34,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 11:24:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3627 transitions. [2018-09-18 11:24:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-18 11:24:34,050 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:34,050 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:24:34,053 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash 239746622, now seen corresponding path program 1 times [2018-09-18 11:24:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:34,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:34,055 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-18 11:24:34,852 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:34,852 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-18 11:24:34,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:34,875 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:24:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:35,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:37,325 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_24 Int)) (let ((.cse0 (div v_prenex_24 5))) (let ((.cse1 (mod .cse0 90))) (and (< .cse0 0) (<= |c_old(~a23~0)| v_prenex_24) (= 0 (mod v_prenex_24 5)) (= (mod (+ .cse0 1) 90) 0) (<= (+ c_~a23~0 41) .cse1) (not (= 0 .cse1)))))) (exists ((v_prenex_18 Int)) (let ((.cse3 (div v_prenex_18 5))) (let ((.cse2 (+ .cse3 1))) (and (<= c_~a23~0 (+ (mod .cse2 90) 49)) (<= 0 .cse2) (< v_prenex_18 0) (<= |c_old(~a23~0)| v_prenex_18) (not (= 0 (mod v_prenex_18 5))) (<= 0 .cse3))))) (exists ((v_prenex_13 Int)) (let ((.cse5 (div v_prenex_13 5))) (let ((.cse4 (mod .cse5 90))) (and (= 0 .cse4) (<= |c_old(~a23~0)| v_prenex_13) (= 0 (mod v_prenex_13 5)) (<= 0 (+ .cse5 1)) (<= c_~a23~0 (+ .cse4 49)))))) (exists ((v_prenex_8 Int)) (let ((.cse6 (div v_prenex_8 5))) (and (<= 0 v_prenex_8) (= (mod (+ .cse6 1) 90) 0) (<= 0 .cse6) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ (mod .cse6 90) 49))))) (exists ((v_prenex_17 Int)) (let ((.cse9 (div v_prenex_17 5))) (let ((.cse8 (+ .cse9 1))) (let ((.cse7 (mod .cse8 90))) (and (< v_prenex_17 0) (<= (+ c_~a23~0 41) .cse7) (< .cse8 0) (<= |c_old(~a23~0)| v_prenex_17) (not (= 0 (mod v_prenex_17 5))) (= 0 (mod .cse9 90)) (not (= .cse7 0))))))) (exists ((v_prenex_4 Int)) (let ((.cse11 (div v_prenex_4 5))) (let ((.cse10 (mod (+ .cse11 1) 90))) (and (= .cse10 0) (< v_prenex_4 0) (<= c_~a23~0 (+ .cse10 49)) (= 0 (mod .cse11 90)) (not (= 0 (mod v_prenex_4 5))) (<= |c_old(~a23~0)| v_prenex_4))))) (exists ((v_prenex_26 Int)) (let ((.cse12 (div v_prenex_26 5))) (let ((.cse13 (mod .cse12 90))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse12 1)) (<= 0 v_prenex_26) (= 0 .cse13) (<= c_~a23~0 (+ .cse13 49)))))) (exists ((v_prenex_3 Int)) (let ((.cse14 (div v_prenex_3 5))) (let ((.cse15 (+ .cse14 1))) (and (<= c_~a23~0 (+ (mod .cse14 90) 49)) (<= 0 v_prenex_3) (<= 0 .cse14) (not (= (mod .cse15 90) 0)) (<= |c_old(~a23~0)| v_prenex_3) (< .cse15 0))))) (exists ((v_prenex_6 Int)) (let ((.cse17 (div v_prenex_6 5))) (let ((.cse16 (mod .cse17 90))) (and (= 0 .cse16) (<= c_~a23~0 (+ .cse16 49)) (= (mod (+ .cse17 1) 90) 0) (<= |c_old(~a23~0)| v_prenex_6) (<= 0 v_prenex_6))))) (exists ((v_prenex_11 Int)) (let ((.cse18 (div v_prenex_11 5))) (let ((.cse19 (mod .cse18 90)) (.cse20 (+ .cse18 1))) (and (< .cse18 0) (<= (+ c_~a23~0 41) .cse19) (not (= 0 .cse19)) (<= |c_old(~a23~0)| v_prenex_11) (<= 0 v_prenex_11) (not (= (mod .cse20 90) 0)) (< .cse20 0))))) (exists ((v_prenex_14 Int)) (let ((.cse22 (div v_prenex_14 5))) (let ((.cse21 (mod .cse22 90))) (and (<= (+ c_~a23~0 41) .cse21) (<= |c_old(~a23~0)| v_prenex_14) (<= 0 (+ .cse22 1)) (not (= 0 .cse21)) (< .cse22 0) (<= 0 v_prenex_14))))) (exists ((v_~a23~0_492 Int)) (let ((.cse24 (div v_~a23~0_492 5))) (let ((.cse23 (+ .cse24 1))) (let ((.cse25 (mod .cse23 90))) (and (< .cse23 0) (<= 0 .cse24) (< v_~a23~0_492 0) (<= |c_old(~a23~0)| v_~a23~0_492) (<= (+ c_~a23~0 41) .cse25) (not (= .cse25 0)) (not (= 0 (mod v_~a23~0_492 5)))))))) (exists ((v_prenex_19 Int)) (let ((.cse26 (div v_prenex_19 5))) (let ((.cse27 (mod .cse26 90)) (.cse28 (+ .cse26 1))) (and (< .cse26 0) (not (= 0 .cse27)) (<= (+ c_~a23~0 41) .cse27) (= 0 (mod v_prenex_19 5)) (< .cse28 0) (not (= (mod .cse28 90) 0)) (<= |c_old(~a23~0)| v_prenex_19))))) (exists ((v_prenex_22 Int)) (let ((.cse29 (div v_prenex_22 5))) (and (<= |c_old(~a23~0)| v_prenex_22) (<= 0 .cse29) (<= 0 (+ .cse29 1)) (<= 0 v_prenex_22) (<= c_~a23~0 (+ (mod .cse29 90) 49))))) (exists ((v_prenex_5 Int)) (let ((.cse31 (div v_prenex_5 5))) (let ((.cse30 (mod .cse31 90))) (and (<= (+ c_~a23~0 41) .cse30) (< .cse31 0) (<= 0 v_prenex_5) (= (mod (+ .cse31 1) 90) 0) (<= |c_old(~a23~0)| v_prenex_5) (not (= 0 .cse30)))))) (exists ((v_prenex_20 Int)) (let ((.cse33 (div v_prenex_20 5))) (let ((.cse32 (+ .cse33 1))) (and (<= c_~a23~0 (+ (mod .cse32 90) 49)) (< v_prenex_20 0) (<= |c_old(~a23~0)| v_prenex_20) (not (= 0 (mod v_prenex_20 5))) (= 0 (mod .cse33 90)) (<= 0 .cse32))))) (exists ((v_prenex_15 Int)) (let ((.cse34 (div v_prenex_15 5))) (let ((.cse35 (+ .cse34 1))) (and (<= 0 .cse34) (<= c_~a23~0 (+ (mod .cse34 90) 49)) (<= |c_old(~a23~0)| v_prenex_15) (< .cse35 0) (= 0 (mod v_prenex_15 5)) (not (= (mod .cse35 90) 0)))))) (exists ((v_prenex_16 Int)) (let ((.cse37 (div v_prenex_16 5))) (let ((.cse36 (mod .cse37 90))) (and (<= |c_old(~a23~0)| v_prenex_16) (<= c_~a23~0 (+ .cse36 49)) (= 0 (mod v_prenex_16 5)) (= (mod (+ .cse37 1) 90) 0) (= 0 .cse36))))) (exists ((v_prenex_23 Int)) (let ((.cse39 (div v_prenex_23 5))) (let ((.cse38 (mod .cse39 90))) (and (not (= 0 .cse38)) (<= |c_old(~a23~0)| v_prenex_23) (<= (+ c_~a23~0 41) .cse38) (= 0 (mod v_prenex_23 5)) (< .cse39 0) (<= 0 (+ .cse39 1)))))) (exists ((v_prenex_9 Int)) (let ((.cse41 (div v_prenex_9 5))) (let ((.cse40 (mod (+ .cse41 1) 90))) (and (<= |c_old(~a23~0)| v_prenex_9) (= .cse40 0) (< v_prenex_9 0) (< .cse41 0) (<= c_~a23~0 (+ .cse40 49)) (not (= 0 (mod .cse41 90))) (not (= 0 (mod v_prenex_9 5))))))) (exists ((v_prenex_7 Int)) (let ((.cse44 (div v_prenex_7 5))) (let ((.cse42 (+ .cse44 1)) (.cse43 (mod .cse44 90))) (and (= 0 (mod v_prenex_7 5)) (not (= (mod .cse42 90) 0)) (= 0 .cse43) (< .cse42 0) (<= |c_old(~a23~0)| v_prenex_7) (<= c_~a23~0 (+ .cse43 49)))))) (exists ((v_prenex_1 Int)) (let ((.cse45 (div v_prenex_1 5))) (and (<= 0 (+ .cse45 1)) (<= c_~a23~0 (+ (mod .cse45 90) 49)) (= 0 (mod v_prenex_1 5)) (<= 0 .cse45) (<= |c_old(~a23~0)| v_prenex_1)))) (exists ((v_prenex_2 Int)) (let ((.cse46 (div v_prenex_2 5))) (let ((.cse48 (+ .cse46 1))) (let ((.cse47 (mod .cse48 90))) (and (not (= 0 (mod .cse46 90))) (<= |c_old(~a23~0)| v_prenex_2) (not (= .cse47 0)) (<= (+ c_~a23~0 41) .cse47) (< v_prenex_2 0) (< .cse48 0) (< .cse46 0) (not (= 0 (mod v_prenex_2 5)))))))) (exists ((v_prenex_10 Int)) (let ((.cse51 (div v_prenex_10 5))) (let ((.cse50 (+ .cse51 1)) (.cse49 (mod .cse51 90))) (and (= 0 .cse49) (<= 0 v_prenex_10) (not (= (mod .cse50 90) 0)) (< .cse50 0) (<= c_~a23~0 (+ .cse49 49)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_25 Int)) (let ((.cse53 (div v_prenex_25 5))) (let ((.cse52 (mod (+ .cse53 1) 90))) (and (not (= 0 (mod v_prenex_25 5))) (< v_prenex_25 0) (<= c_~a23~0 (+ .cse52 49)) (<= |c_old(~a23~0)| v_prenex_25) (<= 0 .cse53) (= .cse52 0))))) (exists ((v_prenex_12 Int)) (let ((.cse54 (div v_prenex_12 5))) (let ((.cse55 (+ .cse54 1))) (and (<= |c_old(~a23~0)| v_prenex_12) (< .cse54 0) (<= 0 .cse55) (<= c_~a23~0 (+ (mod .cse55 90) 49)) (not (= 0 (mod v_prenex_12 5))) (not (= 0 (mod .cse54 90))) (< v_prenex_12 0))))) (exists ((v_prenex_21 Int)) (let ((.cse56 (div v_prenex_21 5))) (and (<= 0 .cse56) (= (mod (+ .cse56 1) 90) 0) (= 0 (mod v_prenex_21 5)) (<= |c_old(~a23~0)| v_prenex_21) (<= c_~a23~0 (+ (mod .cse56 90) 49)))))) is different from true [2018-09-18 11:24:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 72 trivial. 2 not checked. [2018-09-18 11:24:37,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-18 11:24:38,515 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:24:38,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 8 [2018-09-18 11:24:38,515 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:24:38,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:24:38,516 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:24:38,517 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-18 11:24:38,517 INFO L87 Difference]: Start difference. First operand 2323 states and 3627 transitions. Second operand 3 states. [2018-09-18 11:24:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:40,568 INFO L93 Difference]: Finished difference Result 6306 states and 10211 transitions. [2018-09-18 11:24:40,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:24:40,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-09-18 11:24:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:40,603 INFO L225 Difference]: With dead ends: 6306 [2018-09-18 11:24:40,603 INFO L226 Difference]: Without dead ends: 3989 [2018-09-18 11:24:40,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 439 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-18 11:24:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2018-09-18 11:24:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3955. [2018-09-18 11:24:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2018-09-18 11:24:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 6081 transitions. [2018-09-18 11:24:40,758 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 6081 transitions. Word has length 220 [2018-09-18 11:24:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:40,759 INFO L480 AbstractCegarLoop]: Abstraction has 3955 states and 6081 transitions. [2018-09-18 11:24:40,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:24:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 6081 transitions. [2018-09-18 11:24:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-18 11:24:40,768 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:40,769 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:24:40,769 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1859385058, now seen corresponding path program 1 times [2018-09-18 11:24:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:40,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:40,771 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 11:24:41,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:41,337 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) [2018-09-18 11:24:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:41,351 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:24:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:41,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-18 11:24:41,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-18 11:24:42,898 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 11:24:42,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-18 11:24:42,899 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:24:42,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 11:24:42,900 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 11:24:42,900 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-18 11:24:42,900 INFO L87 Difference]: Start difference. First operand 3955 states and 6081 transitions. Second operand 5 states. [2018-09-18 11:24:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:45,636 INFO L93 Difference]: Finished difference Result 10588 states and 16597 transitions. [2018-09-18 11:24:45,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-18 11:24:45,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-09-18 11:24:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:45,684 INFO L225 Difference]: With dead ends: 10588 [2018-09-18 11:24:45,684 INFO L226 Difference]: Without dead ends: 6639 [2018-09-18 11:24:45,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 466 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:24:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2018-09-18 11:24:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 6588. [2018-09-18 11:24:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6588 states. [2018-09-18 11:24:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9120 transitions. [2018-09-18 11:24:45,898 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9120 transitions. Word has length 236 [2018-09-18 11:24:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:45,898 INFO L480 AbstractCegarLoop]: Abstraction has 6588 states and 9120 transitions. [2018-09-18 11:24:45,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 11:24:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9120 transitions. [2018-09-18 11:24:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-18 11:24:45,917 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:45,917 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 11:24:45,917 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -867635988, now seen corresponding path program 1 times [2018-09-18 11:24:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:45,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:45,919 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-18 11:24:46,174 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 11:24:46,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 11:24:46,174 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 11:24:46,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 11:24:46,175 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 11:24:46,176 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:24:46,176 INFO L87 Difference]: Start difference. First operand 6588 states and 9120 transitions. Second operand 3 states. [2018-09-18 11:24:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:47,780 INFO L93 Difference]: Finished difference Result 15917 states and 23270 transitions. [2018-09-18 11:24:47,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 11:24:47,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-09-18 11:24:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:47,838 INFO L225 Difference]: With dead ends: 15917 [2018-09-18 11:24:47,838 INFO L226 Difference]: Without dead ends: 9335 [2018-09-18 11:24:47,891 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 11:24:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9335 states. [2018-09-18 11:24:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9335 to 9104. [2018-09-18 11:24:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9104 states. [2018-09-18 11:24:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9104 states to 9104 states and 12932 transitions. [2018-09-18 11:24:48,143 INFO L78 Accepts]: Start accepts. Automaton has 9104 states and 12932 transitions. Word has length 251 [2018-09-18 11:24:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:48,144 INFO L480 AbstractCegarLoop]: Abstraction has 9104 states and 12932 transitions. [2018-09-18 11:24:48,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 11:24:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9104 states and 12932 transitions. [2018-09-18 11:24:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-18 11:24:48,225 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:48,225 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 11:24:48,226 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash 399067847, now seen corresponding path program 1 times [2018-09-18 11:24:48,226 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:48,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:48,228 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 11:24:48,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:48,719 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:24:48,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:48,728 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:24:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:48,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 11:24:49,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 11:24:49,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:49,378 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 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:24:49,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:49,396 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:24:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:49,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 11:24:49,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 11:24:49,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:24:49,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-18 11:24:49,977 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:24:49,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 11:24:49,978 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 11:24:49,978 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-18 11:24:49,979 INFO L87 Difference]: Start difference. First operand 9104 states and 12932 transitions. Second operand 9 states. [2018-09-18 11:24:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:24:56,004 INFO L93 Difference]: Finished difference Result 22566 states and 42091 transitions. [2018-09-18 11:24:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-18 11:24:56,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 370 [2018-09-18 11:24:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:24:56,130 INFO L225 Difference]: With dead ends: 22566 [2018-09-18 11:24:56,130 INFO L226 Difference]: Without dead ends: 13278 [2018-09-18 11:24:56,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1502 GetRequests, 1477 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-09-18 11:24:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-09-18 11:24:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 12866. [2018-09-18 11:24:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12866 states. [2018-09-18 11:24:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12866 states to 12866 states and 20698 transitions. [2018-09-18 11:24:56,811 INFO L78 Accepts]: Start accepts. Automaton has 12866 states and 20698 transitions. Word has length 370 [2018-09-18 11:24:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:24:56,812 INFO L480 AbstractCegarLoop]: Abstraction has 12866 states and 20698 transitions. [2018-09-18 11:24:56,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 11:24:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 12866 states and 20698 transitions. [2018-09-18 11:24:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-18 11:24:56,913 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:24:56,914 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 11:24:56,914 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:24:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash 126526519, now seen corresponding path program 1 times [2018-09-18 11:24:56,915 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:24:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:24:56,916 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:24:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 276 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-18 11:24:57,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:57,587 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:24:57,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:57,595 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:24:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:57,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 276 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-18 11:24:57,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 276 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-18 11:24:58,389 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:24:58,389 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 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:24:58,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:24:58,405 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:24:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:24:58,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:24:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 276 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-18 11:24:58,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:24:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 276 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-18 11:24:58,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:24:58,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 15 [2018-09-18 11:24:58,992 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:24:58,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 11:24:58,993 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 11:24:58,993 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-18 11:24:58,993 INFO L87 Difference]: Start difference. First operand 12866 states and 20698 transitions. Second operand 9 states. [2018-09-18 11:25:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:03,797 INFO L93 Difference]: Finished difference Result 28615 states and 48887 transitions. [2018-09-18 11:25:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-18 11:25:03,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 378 [2018-09-18 11:25:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:03,899 INFO L225 Difference]: With dead ends: 28615 [2018-09-18 11:25:03,899 INFO L226 Difference]: Without dead ends: 15944 [2018-09-18 11:25:04,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1560 GetRequests, 1522 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2018-09-18 11:25:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15944 states. [2018-09-18 11:25:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15944 to 15366. [2018-09-18 11:25:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15366 states. [2018-09-18 11:25:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15366 states to 15366 states and 19445 transitions. [2018-09-18 11:25:04,697 INFO L78 Accepts]: Start accepts. Automaton has 15366 states and 19445 transitions. Word has length 378 [2018-09-18 11:25:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:04,697 INFO L480 AbstractCegarLoop]: Abstraction has 15366 states and 19445 transitions. [2018-09-18 11:25:04,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 11:25:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 15366 states and 19445 transitions. [2018-09-18 11:25:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-09-18 11:25:04,779 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:04,780 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 11:25:04,780 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1638506094, now seen corresponding path program 1 times [2018-09-18 11:25:04,780 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:04,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:04,782 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 297 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-09-18 11:25:05,284 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:05,284 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:25:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:05,296 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:05,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-18 11:25:05,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 75 proven. 223 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-09-18 11:25:06,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:06,377 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 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:25:06,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:06,398 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:06,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-18 11:25:06,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 75 proven. 223 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-09-18 11:25:07,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:25:07,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8, 7, 8] total 13 [2018-09-18 11:25:07,460 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:25:07,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 11:25:07,461 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 11:25:07,462 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-09-18 11:25:07,462 INFO L87 Difference]: Start difference. First operand 15366 states and 19445 transitions. Second operand 9 states. [2018-09-18 11:25:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:12,546 INFO L93 Difference]: Finished difference Result 41200 states and 55706 transitions. [2018-09-18 11:25:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-18 11:25:12,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 401 [2018-09-18 11:25:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:12,642 INFO L225 Difference]: With dead ends: 41200 [2018-09-18 11:25:12,643 INFO L226 Difference]: Without dead ends: 26029 [2018-09-18 11:25:12,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1630 GetRequests, 1599 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-09-18 11:25:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26029 states. [2018-09-18 11:25:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26029 to 25826. [2018-09-18 11:25:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25826 states. [2018-09-18 11:25:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25826 states to 25826 states and 32421 transitions. [2018-09-18 11:25:13,389 INFO L78 Accepts]: Start accepts. Automaton has 25826 states and 32421 transitions. Word has length 401 [2018-09-18 11:25:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:13,390 INFO L480 AbstractCegarLoop]: Abstraction has 25826 states and 32421 transitions. [2018-09-18 11:25:13,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 11:25:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25826 states and 32421 transitions. [2018-09-18 11:25:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-09-18 11:25:13,488 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:13,489 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 11:25:13,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 40166720, now seen corresponding path program 1 times [2018-09-18 11:25:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:13,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:13,490 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 95 proven. 462 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-09-18 11:25:14,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:14,446 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:25:14,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:14,455 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:14,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:15,234 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-09-18 11:25:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 675 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-09-18 11:25:15,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 333 proven. 135 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-09-18 11:25:16,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:16,088 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 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 11:25:16,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:16,105 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:16,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 675 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-09-18 11:25:16,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 333 proven. 135 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-09-18 11:25:17,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 11:25:17,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 16 [2018-09-18 11:25:17,323 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 11:25:17,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-18 11:25:17,324 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-18 11:25:17,324 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-09-18 11:25:17,325 INFO L87 Difference]: Start difference. First operand 25826 states and 32421 transitions. Second operand 10 states. [2018-09-18 11:25:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 11:25:29,897 INFO L93 Difference]: Finished difference Result 68175 states and 91463 transitions. [2018-09-18 11:25:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-18 11:25:29,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 544 [2018-09-18 11:25:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 11:25:30,020 INFO L225 Difference]: With dead ends: 68175 [2018-09-18 11:25:30,020 INFO L226 Difference]: Without dead ends: 39706 [2018-09-18 11:25:30,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2288 GetRequests, 2219 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=793, Invalid=3899, Unknown=0, NotChecked=0, Total=4692 [2018-09-18 11:25:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39706 states. [2018-09-18 11:25:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39706 to 37828. [2018-09-18 11:25:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37828 states. [2018-09-18 11:25:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37828 states to 37828 states and 46280 transitions. [2018-09-18 11:25:30,956 INFO L78 Accepts]: Start accepts. Automaton has 37828 states and 46280 transitions. Word has length 544 [2018-09-18 11:25:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 11:25:30,957 INFO L480 AbstractCegarLoop]: Abstraction has 37828 states and 46280 transitions. [2018-09-18 11:25:30,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-18 11:25:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 37828 states and 46280 transitions. [2018-09-18 11:25:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-09-18 11:25:31,107 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 11:25:31,107 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 11:25:31,107 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 11:25:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash -223825787, now seen corresponding path program 1 times [2018-09-18 11:25:31,108 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 11:25:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 11:25:31,109 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 11:25:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 124 proven. 707 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-09-18 11:25:31,963 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 11:25:31,964 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:25:31,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 11:25:31,971 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 11:25:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 11:25:32,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 11:25:40,399 WARN L178 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 40 [2018-09-18 11:25:42,566 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-09-18 11:25:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 544 proven. 402 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-18 11:25:43,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 11:25:47,981 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 11:25:47,982 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1075) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-09-18 11:25:47,987 INFO L168 Benchmark]: Toolchain (without parser) took 98513.84 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 327.2 MB. Max. memory is 7.1 GB. [2018-09-18 11:25:47,988 INFO L168 Benchmark]: CDTParser took 0.22 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-18 11:25:47,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 942.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-18 11:25:47,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-18 11:25:47,991 INFO L168 Benchmark]: Boogie Preprocessor took 385.37 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 822.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -948.7 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-09-18 11:25:47,992 INFO L168 Benchmark]: RCFGBuilder took 4144.28 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 171.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 7.1 GB. [2018-09-18 11:25:47,992 INFO L168 Benchmark]: TraceAbstraction took 92845.46 ms. Allocated memory was 2.4 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 186.6 MB. Max. memory is 7.1 GB. [2018-09-18 11:25:47,997 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.22 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 942.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 190.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 385.37 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 822.6 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -948.7 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4144.28 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 171.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92845.46 ms. Allocated memory was 2.4 GB in the beginning and 4.0 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 186.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label41_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_11-25-48-025.csv Received shutdown request...