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/Problem03_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 10:17:18,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 10:17:18,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 10:17:18,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 10:17:18,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 10:17:18,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 10:17:18,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 10:17:18,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 10:17:18,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 10:17:18,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 10:17:18,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 10:17:18,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 10:17:18,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 10:17:18,800 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 10:17:18,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 10:17:18,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 10:17:18,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 10:17:18,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 10:17:18,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 10:17:18,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 10:17:18,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 10:17:18,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 10:17:18,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 10:17:18,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 10:17:18,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 10:17:18,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 10:17:18,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 10:17:18,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 10:17:18,836 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 10:17:18,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 10:17:18,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 10:17:18,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 10:17:18,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 10:17:18,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 10:17:18,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 10:17:18,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 10:17:18,849 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 10:17:18,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 10:17:18,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 10:17:18,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 10:17:18,880 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 10:17:18,880 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 10:17:18,881 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 10:17:18,881 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 10:17:18,881 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 10:17:18,881 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 10:17:18,881 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 10:17:18,881 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 10:17:18,882 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 10:17:18,883 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 10:17:18,883 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 10:17:18,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 10:17:18,884 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 10:17:18,884 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 10:17:18,884 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 10:17:18,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 10:17:18,885 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 10:17:18,885 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 10:17:18,885 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 10:17:18,885 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 10:17:18,885 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 10:17:18,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:17:18,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 10:17:18,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 10:17:18,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 10:17:18,887 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 10:17:18,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 10:17:18,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 10:17:18,888 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 10:17:18,888 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 10:17:18,888 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 10:17:18,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 10:17:18,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 10:17:18,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 10:17:18,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 10:17:18,964 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 10:17:18,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-09-18 10:17:19,318 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1153418/302bcf25048c44e2b8a8075257c6cec4/FLAGae572fea1 [2018-09-18 10:17:19,720 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 10:17:19,723 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-09-18 10:17:19,744 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1153418/302bcf25048c44e2b8a8075257c6cec4/FLAGae572fea1 [2018-09-18 10:17:19,767 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1153418/302bcf25048c44e2b8a8075257c6cec4 [2018-09-18 10:17:19,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 10:17:19,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 10:17:19,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 10:17:19,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 10:17:19,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 10:17:19,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:17:19" (1/1) ... [2018-09-18 10:17:19,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bf522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:19, skipping insertion in model container [2018-09-18 10:17:19,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:17:19" (1/1) ... [2018-09-18 10:17:19,812 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 10:17:20,549 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:17:20,571 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 10:17:20,809 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:17:20,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20 WrapperNode [2018-09-18 10:17:20,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 10:17:20,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 10:17:20,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 10:17:20,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 10:17:20,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:20,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 10:17:21,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 10:17:21,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 10:17:21,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 10:17:21,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (1/1) ... [2018-09-18 10:17:21,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 10:17:21,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 10:17:21,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 10:17:21,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 10:17:21,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (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 10:17:21,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 10:17:21,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 10:17:21,488 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 10:17:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 10:17:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 10:17:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 10:17:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 10:17:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 10:17:25,957 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 10:17:25,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:17:25 BoogieIcfgContainer [2018-09-18 10:17:25,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 10:17:25,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 10:17:25,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 10:17:25,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 10:17:25,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 10:17:19" (1/3) ... [2018-09-18 10:17:25,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c31105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:17:25, skipping insertion in model container [2018-09-18 10:17:25,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:17:20" (2/3) ... [2018-09-18 10:17:25,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c31105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:17:25, skipping insertion in model container [2018-09-18 10:17:25,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:17:25" (3/3) ... [2018-09-18 10:17:25,967 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-09-18 10:17:25,977 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 10:17:25,987 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 10:17:26,051 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 10:17:26,052 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 10:17:26,052 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 10:17:26,052 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 10:17:26,053 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 10:17:26,053 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 10:17:26,053 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 10:17:26,053 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 10:17:26,053 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 10:17:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-18 10:17:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-18 10:17:26,115 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:26,116 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:26,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 390618596, now seen corresponding path program 1 times [2018-09-18 10:17:26,127 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:26,181 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:27,049 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-09-18 10:17:27,377 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 10:17:27,380 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:27,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 10:17:27,380 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:27,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 10:17:27,404 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 10:17:27,405 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 10:17:27,410 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-09-18 10:17:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:30,541 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-09-18 10:17:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:17:30,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-09-18 10:17:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:30,571 INFO L225 Difference]: With dead ends: 1066 [2018-09-18 10:17:30,571 INFO L226 Difference]: Without dead ends: 748 [2018-09-18 10:17:30,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-18 10:17:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-09-18 10:17:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-09-18 10:17:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-18 10:17:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-09-18 10:17:30,751 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 201 [2018-09-18 10:17:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:30,753 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-09-18 10:17:30,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 10:17:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-09-18 10:17:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-18 10:17:30,769 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:30,770 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:30,770 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1605931427, now seen corresponding path program 1 times [2018-09-18 10:17:30,771 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:30,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:30,772 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:31,088 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-18 10:17:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:31,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:31,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:17:31,375 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:31,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:17:31,379 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:17:31,379 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:17:31,380 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-09-18 10:17:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:34,757 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-09-18 10:17:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 10:17:34,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-09-18 10:17:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:34,768 INFO L225 Difference]: With dead ends: 1590 [2018-09-18 10:17:34,769 INFO L226 Difference]: Without dead ends: 1069 [2018-09-18 10:17:34,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:17:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-09-18 10:17:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-09-18 10:17:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-09-18 10:17:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-09-18 10:17:34,833 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 211 [2018-09-18 10:17:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:34,833 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-09-18 10:17:34,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:17:34,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-09-18 10:17:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-18 10:17:34,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:34,840 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:17:34,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1477255851, now seen corresponding path program 1 times [2018-09-18 10:17:34,841 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:34,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:34,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:34,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:34,842 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:35,137 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:17:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:35,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:35,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:17:35,351 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:35,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:17:35,352 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:17:35,352 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:17:35,353 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-09-18 10:17:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:38,308 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-09-18 10:17:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:17:38,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2018-09-18 10:17:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:38,332 INFO L225 Difference]: With dead ends: 3166 [2018-09-18 10:17:38,332 INFO L226 Difference]: Without dead ends: 2148 [2018-09-18 10:17:38,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-18 10:17:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-09-18 10:17:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-09-18 10:17:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-09-18 10:17:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-09-18 10:17:38,431 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 212 [2018-09-18 10:17:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:38,432 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-09-18 10:17:38,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:17:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-09-18 10:17:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-18 10:17:38,442 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:38,443 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:38,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1229236448, now seen corresponding path program 1 times [2018-09-18 10:17:38,443 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:38,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:38,445 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:38,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:38,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 10:17:38,824 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:38,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:17:38,825 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:17:38,826 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:17:38,826 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-09-18 10:17:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:41,362 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-09-18 10:17:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:17:41,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-09-18 10:17:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:41,399 INFO L225 Difference]: With dead ends: 6108 [2018-09-18 10:17:41,399 INFO L226 Difference]: Without dead ends: 4009 [2018-09-18 10:17:41,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:17:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-09-18 10:17:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-09-18 10:17:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-09-18 10:17:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-09-18 10:17:41,536 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 214 [2018-09-18 10:17:41,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:41,537 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-09-18 10:17:41,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:17:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-09-18 10:17:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-18 10:17:41,553 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:41,554 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:17:41,554 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -565100084, now seen corresponding path program 1 times [2018-09-18 10:17:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:41,556 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:42,046 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-18 10:17:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:42,169 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:42,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-18 10:17:42,169 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:42,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-18 10:17:42,170 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-18 10:17:42,171 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:17:42,171 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-09-18 10:17:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:44,386 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-09-18 10:17:44,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:17:44,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2018-09-18 10:17:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:44,462 INFO L225 Difference]: With dead ends: 12096 [2018-09-18 10:17:44,462 INFO L226 Difference]: Without dead ends: 8129 [2018-09-18 10:17:44,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:17:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-09-18 10:17:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-09-18 10:17:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-09-18 10:17:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-09-18 10:17:44,804 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 220 [2018-09-18 10:17:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:44,804 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-09-18 10:17:44,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-18 10:17:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-09-18 10:17:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-18 10:17:44,837 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:44,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:44,837 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash -314712711, now seen corresponding path program 1 times [2018-09-18 10:17:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:44,839 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:45,097 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:17:45,246 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 10:17:45,246 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:45,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:17:45,246 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:45,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:17:45,247 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:17:45,247 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:17:45,247 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-09-18 10:17:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:47,868 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-09-18 10:17:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:17:47,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2018-09-18 10:17:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:47,973 INFO L225 Difference]: With dead ends: 22960 [2018-09-18 10:17:47,973 INFO L226 Difference]: Without dead ends: 15024 [2018-09-18 10:17:48,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:17:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-09-18 10:17:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-09-18 10:17:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-09-18 10:17:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-09-18 10:17:48,468 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 225 [2018-09-18 10:17:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:48,469 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-09-18 10:17:48,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:17:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-09-18 10:17:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-18 10:17:48,526 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:48,526 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:17:48,527 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 732116718, now seen corresponding path program 1 times [2018-09-18 10:17:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:48,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:48,529 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:49,090 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-18 10:17:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-18 10:17:49,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:17:49,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:17:49,330 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:49,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:17:49,331 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:17:49,331 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:17:49,331 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-09-18 10:17:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:17:53,659 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-09-18 10:17:53,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-18 10:17:53,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-09-18 10:17:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:17:53,731 INFO L225 Difference]: With dead ends: 31818 [2018-09-18 10:17:53,732 INFO L226 Difference]: Without dead ends: 16918 [2018-09-18 10:17:53,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:17:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-09-18 10:17:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-09-18 10:17:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-09-18 10:17:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-09-18 10:17:54,169 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 249 [2018-09-18 10:17:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:17:54,170 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-09-18 10:17:54,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:17:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-09-18 10:17:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-18 10:17:54,233 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:17:54,233 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:17:54,234 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:17:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 646437938, now seen corresponding path program 1 times [2018-09-18 10:17:54,234 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:17:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:54,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:54,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:17:54,235 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:17:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:55,128 WARN L178 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 11 [2018-09-18 10:17:55,401 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-18 10:17:55,908 WARN L178 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-18 10:17:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:56,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:17:56,191 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 10:17:56,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:17:56,201 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:17:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:17:56,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:17:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:56,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:17:57,372 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-18 10:17:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:17:58,048 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:17:58,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 14 [2018-09-18 10:17:58,048 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:17:58,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:17:58,049 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:17:58,050 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-18 10:17:58,050 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 5 states. [2018-09-18 10:18:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:18:02,738 INFO L93 Difference]: Finished difference Result 43978 states and 68708 transitions. [2018-09-18 10:18:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-18 10:18:02,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 280 [2018-09-18 10:18:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:18:02,858 INFO L225 Difference]: With dead ends: 43978 [2018-09-18 10:18:02,858 INFO L226 Difference]: Without dead ends: 27068 [2018-09-18 10:18:02,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 556 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:18:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27068 states. [2018-09-18 10:18:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27068 to 26847. [2018-09-18 10:18:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26847 states. [2018-09-18 10:18:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26847 states to 26847 states and 40396 transitions. [2018-09-18 10:18:03,803 INFO L78 Accepts]: Start accepts. Automaton has 26847 states and 40396 transitions. Word has length 280 [2018-09-18 10:18:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:18:03,804 INFO L480 AbstractCegarLoop]: Abstraction has 26847 states and 40396 transitions. [2018-09-18 10:18:03,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:18:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26847 states and 40396 transitions. [2018-09-18 10:18:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-18 10:18:03,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:18:03,922 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:03,922 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:18:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1028846720, now seen corresponding path program 1 times [2018-09-18 10:18:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:18:03,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:03,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:03,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:03,924 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:18:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:04,252 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:18:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 10:18:05,362 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:18:05,362 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 10:18:05,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:05,378 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:18:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:05,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:18:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 10:18:05,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:18:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 10:18:06,244 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:18:06,244 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 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:18:06,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:06,260 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:18:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:06,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:18:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 10:18:06,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:18:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 10:18:07,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:18:07,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 15 [2018-09-18 10:18:07,201 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:18:07,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-18 10:18:07,202 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-18 10:18:07,202 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:18:07,203 INFO L87 Difference]: Start difference. First operand 26847 states and 40396 transitions. Second operand 13 states. [2018-09-18 10:18:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:18:15,876 INFO L93 Difference]: Finished difference Result 127796 states and 245504 transitions. [2018-09-18 10:18:15,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-18 10:18:15,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 291 [2018-09-18 10:18:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:18:16,623 INFO L225 Difference]: With dead ends: 127796 [2018-09-18 10:18:16,623 INFO L226 Difference]: Without dead ends: 100955 [2018-09-18 10:18:16,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1182 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2018-09-18 10:18:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100955 states. [2018-09-18 10:18:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100955 to 96840. [2018-09-18 10:18:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96840 states. [2018-09-18 10:18:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96840 states to 96840 states and 145480 transitions. [2018-09-18 10:18:20,755 INFO L78 Accepts]: Start accepts. Automaton has 96840 states and 145480 transitions. Word has length 291 [2018-09-18 10:18:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:18:20,756 INFO L480 AbstractCegarLoop]: Abstraction has 96840 states and 145480 transitions. [2018-09-18 10:18:20,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-18 10:18:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 96840 states and 145480 transitions. [2018-09-18 10:18:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-18 10:18:20,934 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:18:20,935 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:20,935 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:18:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1274474568, now seen corresponding path program 1 times [2018-09-18 10:18:20,942 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:18:20,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:20,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:20,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:20,943 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:18:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:21,591 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-18 10:18:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 90 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:18:22,401 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:18:22,401 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 10:18:22,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:22,410 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:18:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:22,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:18:23,532 WARN L178 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-09-18 10:18:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 10:18:23,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:18:24,025 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-09-18 10:18:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-18 10:18:24,237 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 10:18:24,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 16 [2018-09-18 10:18:24,237 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:18:24,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:18:24,239 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:18:24,239 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-09-18 10:18:24,239 INFO L87 Difference]: Start difference. First operand 96840 states and 145480 transitions. Second operand 6 states. [2018-09-18 10:18:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:18:29,818 INFO L93 Difference]: Finished difference Result 197988 states and 322762 transitions. [2018-09-18 10:18:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-18 10:18:29,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 298 [2018-09-18 10:18:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:18:30,546 INFO L225 Difference]: With dead ends: 197988 [2018-09-18 10:18:30,547 INFO L226 Difference]: Without dead ends: 101152 [2018-09-18 10:18:30,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 589 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-09-18 10:18:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101152 states. [2018-09-18 10:18:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101152 to 97672. [2018-09-18 10:18:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97672 states. [2018-09-18 10:18:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97672 states to 97672 states and 146068 transitions. [2018-09-18 10:18:34,504 INFO L78 Accepts]: Start accepts. Automaton has 97672 states and 146068 transitions. Word has length 298 [2018-09-18 10:18:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:18:34,505 INFO L480 AbstractCegarLoop]: Abstraction has 97672 states and 146068 transitions. [2018-09-18 10:18:34,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:18:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 97672 states and 146068 transitions. [2018-09-18 10:18:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-18 10:18:34,671 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:18:34,671 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:18:34,672 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:18:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1103028202, now seen corresponding path program 1 times [2018-09-18 10:18:34,672 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:18:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:34,673 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:18:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:35,273 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-18 10:18:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 100 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-18 10:18:35,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:18:35,444 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:18:35,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:35,451 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:18:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:35,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:18:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-18 10:18:35,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:18:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-18 10:18:36,332 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:18:36,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 15 [2018-09-18 10:18:36,332 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:18:36,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:18:36,333 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:18:36,333 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-09-18 10:18:36,333 INFO L87 Difference]: Start difference. First operand 97672 states and 146068 transitions. Second operand 5 states. [2018-09-18 10:18:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:18:41,523 INFO L93 Difference]: Finished difference Result 293022 states and 462194 transitions. [2018-09-18 10:18:41,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-18 10:18:41,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2018-09-18 10:18:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:18:42,441 INFO L225 Difference]: With dead ends: 293022 [2018-09-18 10:18:42,442 INFO L226 Difference]: Without dead ends: 195356 [2018-09-18 10:18:42,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 613 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-09-18 10:18:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195356 states. [2018-09-18 10:18:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195356 to 192533. [2018-09-18 10:18:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192533 states. [2018-09-18 10:18:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192533 states to 192533 states and 288013 transitions. [2018-09-18 10:18:47,668 INFO L78 Accepts]: Start accepts. Automaton has 192533 states and 288013 transitions. Word has length 310 [2018-09-18 10:18:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:18:47,668 INFO L480 AbstractCegarLoop]: Abstraction has 192533 states and 288013 transitions. [2018-09-18 10:18:47,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:18:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 192533 states and 288013 transitions. [2018-09-18 10:18:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-18 10:18:47,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:18:47,840 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:18:47,840 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:18:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 281948138, now seen corresponding path program 1 times [2018-09-18 10:18:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:18:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:18:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:18:47,841 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:18:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:18:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:18:48,188 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:18:48,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 10:18:48,189 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:18:48,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:18:48,193 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:18:48,193 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:18:48,193 INFO L87 Difference]: Start difference. First operand 192533 states and 288013 transitions. Second operand 3 states. [2018-09-18 10:18:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:18:55,405 INFO L93 Difference]: Finished difference Result 517980 states and 790272 transitions. [2018-09-18 10:18:55,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:18:55,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-09-18 10:18:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:18:56,821 INFO L225 Difference]: With dead ends: 517980 [2018-09-18 10:18:56,821 INFO L226 Difference]: Without dead ends: 325453 [2018-09-18 10:19:04,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:19:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325453 states. [2018-09-18 10:19:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325453 to 324813. [2018-09-18 10:19:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324813 states. [2018-09-18 10:19:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324813 states to 324813 states and 469060 transitions. [2018-09-18 10:19:11,290 INFO L78 Accepts]: Start accepts. Automaton has 324813 states and 469060 transitions. Word has length 308 [2018-09-18 10:19:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:19:11,291 INFO L480 AbstractCegarLoop]: Abstraction has 324813 states and 469060 transitions. [2018-09-18 10:19:11,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:19:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 324813 states and 469060 transitions. [2018-09-18 10:19:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-18 10:19:11,521 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:19:11,521 INFO L376 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:19:11,522 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:19:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1728576349, now seen corresponding path program 1 times [2018-09-18 10:19:11,522 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:19:11,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:19:11,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:19:11,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:19:11,523 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:19:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:19:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-18 10:19:11,909 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:19:11,909 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 10:19:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:19:11,917 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:19:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:19:12,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:19:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:19:12,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:19:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-18 10:19:13,825 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:19:13,825 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 10:19:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:19:13,842 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:19:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:19:14,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:19:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 10:19:14,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:19:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-18 10:19:14,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 10:19:14,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-09-18 10:19:14,833 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 10:19:14,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 10:19:14,834 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 10:19:14,834 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-09-18 10:19:14,834 INFO L87 Difference]: Start difference. First operand 324813 states and 469060 transitions. Second operand 9 states. [2018-09-18 10:19:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:19:33,023 INFO L93 Difference]: Finished difference Result 789760 states and 1277503 transitions. [2018-09-18 10:19:33,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-18 10:19:33,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2018-09-18 10:19:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:19:36,465 INFO L225 Difference]: With dead ends: 789760 [2018-09-18 10:19:36,465 INFO L226 Difference]: Without dead ends: 464953 [2018-09-18 10:19:38,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1299 GetRequests, 1274 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-09-18 10:19:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464953 states. [2018-09-18 10:19:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464953 to 447151. [2018-09-18 10:19:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447151 states. [2018-09-18 10:20:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447151 states to 447151 states and 598497 transitions. [2018-09-18 10:20:01,804 INFO L78 Accepts]: Start accepts. Automaton has 447151 states and 598497 transitions. Word has length 319 [2018-09-18 10:20:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:20:01,805 INFO L480 AbstractCegarLoop]: Abstraction has 447151 states and 598497 transitions. [2018-09-18 10:20:01,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 10:20:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 447151 states and 598497 transitions. [2018-09-18 10:20:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-18 10:20:02,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:20:02,072 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:20:02,072 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:20:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1118165318, now seen corresponding path program 1 times [2018-09-18 10:20:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:20:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:20:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:20:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:20:02,074 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:20:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:20:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:20:02,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:20:02,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:20:02,682 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:20:02,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:20:02,683 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:20:02,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:20:02,683 INFO L87 Difference]: Start difference. First operand 447151 states and 598497 transitions. Second operand 5 states. [2018-09-18 10:20:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:20:15,806 INFO L93 Difference]: Finished difference Result 947849 states and 1274998 transitions. [2018-09-18 10:20:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-18 10:20:15,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 332 [2018-09-18 10:20:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:20:19,189 INFO L225 Difference]: With dead ends: 947849 [2018-09-18 10:20:19,190 INFO L226 Difference]: Without dead ends: 500925 [2018-09-18 10:20:19,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:20:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500925 states. [2018-09-18 10:20:30,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500925 to 492334. [2018-09-18 10:20:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492334 states. Received shutdown request... [2018-09-18 10:20:48,168 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-18 10:20:48,175 WARN L206 ceAbstractionStarter]: Timeout [2018-09-18 10:20:48,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 10:20:48 BoogieIcfgContainer [2018-09-18 10:20:48,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 10:20:48,176 INFO L168 Benchmark]: Toolchain (without parser) took 208395.50 ms. Allocated memory was 1.5 GB in the beginning and 7.3 GB in the end (delta: 5.7 GB). Free memory was 1.4 GB in the beginning and 4.5 GB in the end (delta: -3.1 GB). Peak memory consumption was 5.7 GB. Max. memory is 7.1 GB. [2018-09-18 10:20:48,177 INFO L168 Benchmark]: CDTParser took 0.21 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 10:20:48,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1085.91 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-09-18 10:20:48,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-18 10:20:48,179 INFO L168 Benchmark]: Boogie Preprocessor took 362.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -949.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2018-09-18 10:20:48,180 INFO L168 Benchmark]: RCFGBuilder took 4572.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 254.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. [2018-09-18 10:20:48,181 INFO L168 Benchmark]: TraceAbstraction took 202215.92 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 4.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.5 GB. Max. memory is 7.1 GB. [2018-09-18 10:20:48,185 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.21 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 1085.91 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 150.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 362.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -949.1 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4572.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 254.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202215.92 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 4.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while ReachableStatesComputation was computing reachable states (486891 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 202.1s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 106.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2571 SDtfs, 19177 SDslu, 3482 SDs, 0 SdLazy, 21385 SolverSat, 5126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4408 GetRequests, 4238 SyntacticMatches, 22 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447151occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 73.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 29773 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 5778 NumberOfCodeBlocks, 5778 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7858 ConstructedInterpolants, 0 QuantifiedInterpolants, 7923246 SizeOfPredicates, 34 NumberOfNonLiveVariables, 8471 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 2621/2978 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label53_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_10-20-48-204.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label53_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_10-20-48-204.csv Completed graceful shutdown