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/Problem02_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 15:59:45,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:59:45,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:59:45,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:59:45,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:59:45,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:59:45,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:59:45,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:59:45,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:59:45,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:59:45,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:59:45,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:59:45,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:59:45,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:59:45,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:59:45,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:59:45,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:59:45,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:59:45,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:59:45,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:59:45,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:59:45,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:59:45,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:59:45,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:59:45,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:59:45,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:59:45,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:59:45,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:59:45,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:59:45,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:59:45,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:59:45,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:59:45,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:59:45,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:59:45,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:59:45,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:59:45,068 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 15:59:45,090 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:59:45,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:59:45,092 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:59:45,093 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:59:45,093 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:59:45,093 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:59:45,093 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:59:45,093 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:59:45,094 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:59:45,094 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:59:45,094 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:59:45,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:59:45,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:59:45,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:59:45,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:59:45,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:59:45,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:59:45,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:59:45,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:59:45,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:59:45,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:59:45,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:59:45,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:59:45,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:59:45,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:59:45,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:59:45,098 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:59:45,098 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:59:45,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:59:45,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:59:45,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:59:45,099 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:59:45,099 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:59:45,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:59:45,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:59:45,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:59:45,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:59:45,183 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:59:45,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-09-14 15:59:45,526 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a1b2154/edddc426850640638f62fb52b8d6143f/FLAGa87c4e2b9 [2018-09-14 15:59:45,813 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:59:45,814 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-09-14 15:59:45,828 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a1b2154/edddc426850640638f62fb52b8d6143f/FLAGa87c4e2b9 [2018-09-14 15:59:45,844 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26a1b2154/edddc426850640638f62fb52b8d6143f [2018-09-14 15:59:45,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:59:45,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:59:45,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:59:45,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:59:45,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:59:45,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:59:45" (1/1) ... [2018-09-14 15:59:45,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1dc611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:45, skipping insertion in model container [2018-09-14 15:59:45,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:59:45" (1/1) ... [2018-09-14 15:59:45,886 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:59:46,423 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:59:46,447 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:59:46,554 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:59:46,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46 WrapperNode [2018-09-14 15:59:46,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:59:46,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:59:46,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:59:46,591 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:59:46,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:59:46,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:59:46,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:59:46,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:59:46,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... [2018-09-14 15:59:46,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:59:46,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:59:46,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:59:46,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:59:46,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:59:46,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:59:46,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:59:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 15:59:46,951 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 15:59:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:59:46,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:59:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:59:46,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:59:50,285 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:59:50,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:59:50 BoogieIcfgContainer [2018-09-14 15:59:50,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:59:50,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:59:50,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:59:50,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:59:50,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:59:45" (1/3) ... [2018-09-14 15:59:50,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521dc175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:59:50, skipping insertion in model container [2018-09-14 15:59:50,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:59:46" (2/3) ... [2018-09-14 15:59:50,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521dc175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:59:50, skipping insertion in model container [2018-09-14 15:59:50,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:59:50" (3/3) ... [2018-09-14 15:59:50,298 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-09-14 15:59:50,308 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:59:50,320 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:59:50,371 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:59:50,372 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:59:50,372 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:59:50,372 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:59:50,372 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:59:50,372 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:59:50,373 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:59:50,373 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:59:50,373 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:59:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-14 15:59:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-14 15:59:50,418 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:59:50,420 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] [2018-09-14 15:59:50,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:59:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-09-14 15:59:50,428 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:59:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:50,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:59:50,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:50,477 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:59:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:59:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:59:51,083 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:59:51,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 15:59:51,083 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:59:51,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:59:51,105 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:59:51,105 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:59:51,108 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-14 15:59:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:59:52,786 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-09-14 15:59:52,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 15:59:52,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-09-14 15:59:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:59:52,809 INFO L225 Difference]: With dead ends: 627 [2018-09-14 15:59:52,809 INFO L226 Difference]: Without dead ends: 388 [2018-09-14 15:59:52,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:59:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-09-14 15:59:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-09-14 15:59:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-14 15:59:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-09-14 15:59:52,891 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-09-14 15:59:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:59:52,892 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-09-14 15:59:52,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 15:59:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-09-14 15:59:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-14 15:59:52,901 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:59:52,901 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] [2018-09-14 15:59:52,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:59:52,902 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-09-14 15:59:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:59:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:52,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:59:52,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:52,904 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:59:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:59:53,500 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-14 15:59:53,702 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-14 15:59:53,703 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:59:53,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 15:59:53,703 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:59:53,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 15:59:53,706 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 15:59:53,706 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:59:53,706 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-09-14 15:59:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:59:55,601 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-09-14 15:59:55,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 15:59:55,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-09-14 15:59:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:59:55,606 INFO L225 Difference]: With dead ends: 905 [2018-09-14 15:59:55,606 INFO L226 Difference]: Without dead ends: 382 [2018-09-14 15:59:55,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 15:59:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-14 15:59:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-14 15:59:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-14 15:59:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-09-14 15:59:55,644 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-09-14 15:59:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:59:55,644 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-09-14 15:59:55,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 15:59:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-09-14 15:59:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-14 15:59:55,648 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:59:55,648 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-14 15:59:55,649 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:59:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-09-14 15:59:55,649 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:59:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:59:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:55,651 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:59:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:59:55,925 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-14 15:59:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:59:56,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:59:56,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 15:59:56,091 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:59:56,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 15:59:56,092 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 15:59:56,092 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 15:59:56,093 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-09-14 15:59:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:59:58,608 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-09-14 15:59:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 15:59:58,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-09-14 15:59:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:59:58,617 INFO L225 Difference]: With dead ends: 1241 [2018-09-14 15:59:58,617 INFO L226 Difference]: Without dead ends: 865 [2018-09-14 15:59:58,620 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-14 15:59:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-09-14 15:59:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-09-14 15:59:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-09-14 15:59:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-09-14 15:59:58,670 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-09-14 15:59:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:59:58,670 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-09-14 15:59:58,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 15:59:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-09-14 15:59:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-14 15:59:58,681 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:59:58,682 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-14 15:59:58,682 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:59:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-09-14 15:59:58,682 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:59:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:58,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:59:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:59:58,685 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:59:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:59:58,991 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 15:59:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:59:59,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:59:59,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 15:59:59,055 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:59:59,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:59:59,056 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:59:59,056 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:59:59,057 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-09-14 16:00:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:01,654 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-09-14 16:00:01,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:00:01,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-09-14 16:00:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:01,667 INFO L225 Difference]: With dead ends: 2297 [2018-09-14 16:00:01,667 INFO L226 Difference]: Without dead ends: 1485 [2018-09-14 16:00:01,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:00:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-09-14 16:00:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-09-14 16:00:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-09-14 16:00:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-09-14 16:00:01,721 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-09-14 16:00:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:01,722 INFO L480 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-09-14 16:00:01,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:00:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-09-14 16:00:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-14 16:00:01,728 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:01,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:01,728 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-09-14 16:00:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:01,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:01,730 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:02,184 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-14 16:00:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:00:02,402 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:00:02,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 16:00:02,402 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:00:02,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:00:02,403 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:00:02,403 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 16:00:02,404 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-09-14 16:00:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:03,471 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-09-14 16:00:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 16:00:03,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-09-14 16:00:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:03,489 INFO L225 Difference]: With dead ends: 3050 [2018-09-14 16:00:03,489 INFO L226 Difference]: Without dead ends: 1430 [2018-09-14 16:00:03,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-14 16:00:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-09-14 16:00:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-09-14 16:00:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-09-14 16:00:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-09-14 16:00:03,554 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-09-14 16:00:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:03,554 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-09-14 16:00:03,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:00:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-09-14 16:00:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-14 16:00:03,561 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:03,561 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:03,562 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-09-14 16:00:03,562 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:03,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:03,564 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:00:03,789 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:03,789 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:00:03,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:03,800 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:03,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:00:04,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:00:04,785 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:04,785 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 3 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 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:00:04,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:04,813 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:04,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:00:05,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:00:05,355 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:00:05,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 16 [2018-09-14 16:00:05,355 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:00:05,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 16:00:05,358 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 16:00:05,359 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-14 16:00:05,360 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 13 states. [2018-09-14 16:00:06,441 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-14 16:00:06,782 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-14 16:00:09,412 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-09-14 16:00:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:14,040 INFO L93 Difference]: Finished difference Result 6056 states and 12507 transitions. [2018-09-14 16:00:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-14 16:00:14,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 163 [2018-09-14 16:00:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:14,113 INFO L225 Difference]: With dead ends: 6056 [2018-09-14 16:00:14,113 INFO L226 Difference]: Without dead ends: 4632 [2018-09-14 16:00:14,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 676 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=706, Invalid=2050, Unknown=0, NotChecked=0, Total=2756 [2018-09-14 16:00:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2018-09-14 16:00:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4060. [2018-09-14 16:00:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2018-09-14 16:00:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5628 transitions. [2018-09-14 16:00:14,383 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5628 transitions. Word has length 163 [2018-09-14 16:00:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:14,384 INFO L480 AbstractCegarLoop]: Abstraction has 4060 states and 5628 transitions. [2018-09-14 16:00:14,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 16:00:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5628 transitions. [2018-09-14 16:00:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-14 16:00:14,404 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:14,404 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:14,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2071604915, now seen corresponding path program 1 times [2018-09-14 16:00:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:14,406 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:00:14,623 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:14,623 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:00:14,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:14,638 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:14,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-14 16:00:14,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-14 16:00:15,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:00:15,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2018-09-14 16:00:15,776 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:00:15,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 16:00:15,777 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 16:00:15,777 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:00:15,777 INFO L87 Difference]: Start difference. First operand 4060 states and 5628 transitions. Second operand 4 states. [2018-09-14 16:00:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:17,095 INFO L93 Difference]: Finished difference Result 11341 states and 16156 transitions. [2018-09-14 16:00:17,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 16:00:17,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-09-14 16:00:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:17,150 INFO L225 Difference]: With dead ends: 11341 [2018-09-14 16:00:17,150 INFO L226 Difference]: Without dead ends: 7287 [2018-09-14 16:00:17,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 323 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:00:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2018-09-14 16:00:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 7268. [2018-09-14 16:00:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7268 states. [2018-09-14 16:00:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7268 states to 7268 states and 10080 transitions. [2018-09-14 16:00:17,417 INFO L78 Accepts]: Start accepts. Automaton has 7268 states and 10080 transitions. Word has length 164 [2018-09-14 16:00:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:17,417 INFO L480 AbstractCegarLoop]: Abstraction has 7268 states and 10080 transitions. [2018-09-14 16:00:17,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 16:00:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7268 states and 10080 transitions. [2018-09-14 16:00:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-14 16:00:17,441 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:17,441 INFO L376 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:17,442 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -784995276, now seen corresponding path program 1 times [2018-09-14 16:00:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:17,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:17,444 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 71 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-14 16:00:17,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:17,693 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-14 16:00:17,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:17,701 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:17,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-09-14 16:00:18,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-14 16:00:18,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:00:18,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-09-14 16:00:18,140 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:00:18,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:00:18,140 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:00:18,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-09-14 16:00:18,141 INFO L87 Difference]: Start difference. First operand 7268 states and 10080 transitions. Second operand 5 states. [2018-09-14 16:00:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:19,785 INFO L93 Difference]: Finished difference Result 18038 states and 26600 transitions. [2018-09-14 16:00:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 16:00:19,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-09-14 16:00:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:19,854 INFO L225 Difference]: With dead ends: 18038 [2018-09-14 16:00:19,854 INFO L226 Difference]: Without dead ends: 10776 [2018-09-14 16:00:19,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 16:00:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2018-09-14 16:00:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 10333. [2018-09-14 16:00:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10333 states. [2018-09-14 16:00:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10333 states to 10333 states and 13655 transitions. [2018-09-14 16:00:20,225 INFO L78 Accepts]: Start accepts. Automaton has 10333 states and 13655 transitions. Word has length 179 [2018-09-14 16:00:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:20,226 INFO L480 AbstractCegarLoop]: Abstraction has 10333 states and 13655 transitions. [2018-09-14 16:00:20,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:00:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10333 states and 13655 transitions. [2018-09-14 16:00:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-14 16:00:20,263 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:20,264 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:20,264 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1700307470, now seen corresponding path program 1 times [2018-09-14 16:00:20,264 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:20,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:20,266 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:20,513 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:00:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-14 16:00:20,924 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:20,924 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:00:20,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:20,940 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:21,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-14 16:00:21,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-14 16:00:21,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:00:21,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 16:00:21,816 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:00:21,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:00:21,817 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:00:21,817 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 16:00:21,817 INFO L87 Difference]: Start difference. First operand 10333 states and 13655 transitions. Second operand 5 states. [2018-09-14 16:00:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:23,177 INFO L93 Difference]: Finished difference Result 21968 states and 29351 transitions. [2018-09-14 16:00:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:00:23,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-09-14 16:00:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:23,222 INFO L225 Difference]: With dead ends: 21968 [2018-09-14 16:00:23,222 INFO L226 Difference]: Without dead ends: 11641 [2018-09-14 16:00:23,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-09-14 16:00:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11641 states. [2018-09-14 16:00:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11641 to 11584. [2018-09-14 16:00:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11584 states. [2018-09-14 16:00:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11584 states to 11584 states and 14973 transitions. [2018-09-14 16:00:23,533 INFO L78 Accepts]: Start accepts. Automaton has 11584 states and 14973 transitions. Word has length 236 [2018-09-14 16:00:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:23,533 INFO L480 AbstractCegarLoop]: Abstraction has 11584 states and 14973 transitions. [2018-09-14 16:00:23,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:00:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11584 states and 14973 transitions. [2018-09-14 16:00:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-14 16:00:23,566 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:23,566 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:23,567 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash -326102629, now seen corresponding path program 1 times [2018-09-14 16:00:23,567 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:23,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:23,569 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 153 proven. 71 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-14 16:00:23,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:23,925 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-14 16:00:23,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:23,934 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:24,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:00:24,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-14 16:00:24,451 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:24,451 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-14 16:00:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:24,466 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:24,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:00:24,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-14 16:00:24,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:00:24,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 5, 5] total 23 [2018-09-14 16:00:24,996 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:00:24,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 16:00:24,998 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 16:00:24,998 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-09-14 16:00:24,998 INFO L87 Difference]: Start difference. First operand 11584 states and 14973 transitions. Second operand 15 states. [2018-09-14 16:00:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:28,945 INFO L93 Difference]: Finished difference Result 22381 states and 28948 transitions. [2018-09-14 16:00:28,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-14 16:00:28,945 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 244 [2018-09-14 16:00:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:28,967 INFO L225 Difference]: With dead ends: 22381 [2018-09-14 16:00:28,967 INFO L226 Difference]: Without dead ends: 7800 [2018-09-14 16:00:28,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 980 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2018-09-14 16:00:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2018-09-14 16:00:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 7150. [2018-09-14 16:00:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7150 states. [2018-09-14 16:00:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 8621 transitions. [2018-09-14 16:00:29,149 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 8621 transitions. Word has length 244 [2018-09-14 16:00:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:29,149 INFO L480 AbstractCegarLoop]: Abstraction has 7150 states and 8621 transitions. [2018-09-14 16:00:29,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-14 16:00:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 8621 transitions. [2018-09-14 16:00:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-14 16:00:29,167 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:29,167 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:29,167 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash 623655535, now seen corresponding path program 1 times [2018-09-14 16:00:29,168 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:29,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:29,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:29,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:29,169 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:29,379 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:00:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-09-14 16:00:29,423 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:29,423 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:00:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:29,431 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:29,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-14 16:00:29,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-09-14 16:00:29,734 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:29,735 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:00:29,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:29,751 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:29,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-09-14 16:00:29,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 140 proven. 54 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-09-14 16:00:30,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:00:30,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-14 16:00:30,072 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:00:30,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 16:00:30,073 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 16:00:30,073 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-14 16:00:30,073 INFO L87 Difference]: Start difference. First operand 7150 states and 8621 transitions. Second operand 9 states. [2018-09-14 16:00:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:30,872 INFO L93 Difference]: Finished difference Result 13431 states and 16297 transitions. [2018-09-14 16:00:30,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 16:00:30,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2018-09-14 16:00:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:30,887 INFO L225 Difference]: With dead ends: 13431 [2018-09-14 16:00:30,887 INFO L226 Difference]: Without dead ends: 6432 [2018-09-14 16:00:30,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 979 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:00:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2018-09-14 16:00:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 6396. [2018-09-14 16:00:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2018-09-14 16:00:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 7524 transitions. [2018-09-14 16:00:31,022 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 7524 transitions. Word has length 246 [2018-09-14 16:00:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:31,022 INFO L480 AbstractCegarLoop]: Abstraction has 6396 states and 7524 transitions. [2018-09-14 16:00:31,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 16:00:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 7524 transitions. [2018-09-14 16:00:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-14 16:00:31,037 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:31,037 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 16:00:31,037 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1812013721, now seen corresponding path program 1 times [2018-09-14 16:00:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:31,039 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 54 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-14 16:00:31,462 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:31,462 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:00:31,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:31,477 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:31,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:00:31,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 180 proven. 36 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-14 16:00:32,060 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:32,061 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:00:32,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:32,077 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:32,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:00:32,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 180 proven. 36 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-14 16:00:32,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:00:32,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 17 [2018-09-14 16:00:32,490 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:00:32,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 16:00:32,490 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 16:00:32,490 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-14 16:00:32,491 INFO L87 Difference]: Start difference. First operand 6396 states and 7524 transitions. Second operand 9 states. [2018-09-14 16:00:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:35,509 INFO L93 Difference]: Finished difference Result 14807 states and 17652 transitions. [2018-09-14 16:00:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-14 16:00:35,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 250 [2018-09-14 16:00:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:35,524 INFO L225 Difference]: With dead ends: 14807 [2018-09-14 16:00:35,524 INFO L226 Difference]: Without dead ends: 7567 [2018-09-14 16:00:35,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2018-09-14 16:00:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2018-09-14 16:00:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 5198. [2018-09-14 16:00:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2018-09-14 16:00:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 5639 transitions. [2018-09-14 16:00:35,657 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 5639 transitions. Word has length 250 [2018-09-14 16:00:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:35,657 INFO L480 AbstractCegarLoop]: Abstraction has 5198 states and 5639 transitions. [2018-09-14 16:00:35,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 16:00:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 5639 transitions. [2018-09-14 16:00:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-14 16:00:35,669 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:00:35,670 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-14 16:00:35,670 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:00:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2002622650, now seen corresponding path program 1 times [2018-09-14 16:00:35,671 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:00:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:35,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:00:35,672 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:00:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:35,960 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:00:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 235 proven. 62 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-09-14 16:00:36,906 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:36,906 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:00:36,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:36,913 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:37,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:00:37,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-14 16:00:37,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:00:37,574 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 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:00:37,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:00:37,590 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:00:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:00:37,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:00:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:00:38,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:00:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-14 16:00:38,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:00:38,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 5, 5] total 13 [2018-09-14 16:00:38,313 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:00:38,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-14 16:00:38,314 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-14 16:00:38,314 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-14 16:00:38,314 INFO L87 Difference]: Start difference. First operand 5198 states and 5639 transitions. Second operand 11 states. [2018-09-14 16:00:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:00:40,784 INFO L93 Difference]: Finished difference Result 9450 states and 10241 transitions. [2018-09-14 16:00:40,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-14 16:00:40,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 291 [2018-09-14 16:00:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:00:40,786 INFO L225 Difference]: With dead ends: 9450 [2018-09-14 16:00:40,786 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 16:00:40,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1165 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-09-14 16:00:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 16:00:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 16:00:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 16:00:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 16:00:40,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2018-09-14 16:00:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:00:40,798 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 16:00:40,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-14 16:00:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 16:00:40,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 16:00:40,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 16:00:41,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,812 WARN L178 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 208 [2018-09-14 16:00:41,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:41,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 16:00:42,437 WARN L178 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 208 [2018-09-14 16:00:43,013 WARN L178 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-09-14 16:00:43,137 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2018-09-14 16:00:49,241 WARN L178 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 281 DAG size of output: 93 [2018-09-14 16:00:50,876 WARN L178 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 197 DAG size of output: 89 [2018-09-14 16:00:52,532 WARN L178 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 197 DAG size of output: 89 [2018-09-14 16:00:52,535 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 16:00:52,535 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-09-14 16:00:52,535 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 16:00:52,535 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,535 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,535 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-14 16:00:52,536 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-14 16:00:52,537 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-14 16:00:52,538 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-14 16:00:52,539 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,540 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,541 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,541 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-14 16:00:52,542 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,543 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-14 16:00:52,544 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,545 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-14 16:00:52,546 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-14 16:00:52,547 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,548 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-14 16:00:52,549 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,550 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-14 16:00:52,551 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,552 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a25~0)|)) (.cse3 (= 9 |old(~a28~0)|)) (.cse24 (= |old(~a17~0)| ~a17~0)) (.cse17 (= |old(~a19~0)| ~a19~0)) (.cse26 (= ~a25~0 |old(~a25~0)|)) (.cse16 (= ~a11~0 |old(~a11~0)|)) (.cse18 (= ~a17~0 7)) (.cse25 (= ~a19~0 1)) (.cse19 (= ~a28~0 |old(~a28~0)|))) (let ((.cse15 (and .cse16 .cse18 .cse25 .cse19)) (.cse8 (not (= ~a25~0 1))) (.cse11 (not (= 7 |old(~a17~0)|))) (.cse13 (< |old(~a28~0)| 9)) (.cse23 (< 7 |old(~a28~0)|)) (.cse7 (and .cse16 .cse24 .cse17 .cse19 .cse26)) (.cse5 (< 0 |old(~a19~0)|)) (.cse27 (not .cse3)) (.cse12 (= |old(~a11~0)| |old(~a19~0)|)) (.cse21 (not .cse6)) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse1 (not (= 1 ~a21~0))) (.cse14 (and .cse16 .cse24 .cse25 .cse19 .cse26)) (.cse22 (< 0 |old(~a11~0)|)) (.cse0 (< 10 |old(~a28~0)|)) (.cse9 (not (= 1 |old(~a19~0)|))) (.cse2 (= 10 |old(~a28~0)|)) (.cse20 (= |old(~a17~0)| |old(~a28~0)|)) (.cse10 (= 8 |old(~a28~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse9 .cse10 .cse6 .cse11) (or (or .cse0 .cse1 .cse9 .cse12 .cse4) .cse13 .cse14) (or .cse1 .cse9 .cse10 .cse15 .cse6 .cse11) (or .cse1 (and .cse16 .cse17 .cse18 .cse19) .cse2 .cse20 .cse10 .cse12 .cse11) (or .cse14 (or .cse21 (or .cse1 .cse9 .cse22) .cse4)) (or .cse1 .cse23 .cse9 .cse15 .cse11) (or .cse1 (and .cse16 .cse8 .cse17 .cse18 .cse19) .cse20 .cse10 .cse12 .cse6 .cse11) (or .cse0 .cse1 .cse21 .cse13 .cse3 .cse22 .cse4 .cse7 .cse5) (or .cse1 .cse7 .cse3 .cse0 .cse2 .cse10 .cse4 .cse5) (or .cse21 (and (and .cse16 .cse24 .cse25 .cse19) .cse26) (or .cse1 .cse23 .cse9 .cse4)) (or (or .cse1 .cse9 .cse4) .cse14 .cse27) (or .cse1 .cse7 .cse6 .cse12 .cse4 .cse5 .cse27) (or .cse14 (or .cse1 .cse21 .cse9 .cse20 .cse12 .cse4)) (or .cse1 (not .cse2) .cse21 .cse9 (and (= 1 ~a11~0) (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0) (= 10 ~a28~0)) .cse4 (not (= 1 |old(~a11~0)|))) (or .cse1 .cse14 .cse3 .cse22 .cse6 .cse0 .cse9 .cse2 .cse20 .cse10 (< 8 |old(~a17~0)|))))) [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-14 16:00:52,553 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,554 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-14 16:00:52,555 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-14 16:00:52,556 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-14 16:00:52,557 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-14 16:00:52,558 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 16:00:52,559 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a28~0 ~a17~0)) (not (= ~a25~0 1)) (<= ~a28~0 10) (not (= ~a28~0 8)) (= ~a19~0 1) (<= ~a11~0 0) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a28~0 9)) (not (= ~a28~0 10))) [2018-09-14 16:00:52,560 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 16:00:52,560 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 16:00:52,560 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 9 |old(~a28~0)|) (< 0 |old(~a11~0)|) (= 1 |old(~a25~0)|) (< 10 |old(~a28~0)|) (not (= 1 |old(~a19~0)|)) (= 10 |old(~a28~0)|) (= |old(~a17~0)| |old(~a28~0)|) (= 8 |old(~a28~0)|) (< 8 |old(~a17~0)|)) [2018-09-14 16:00:52,560 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-14 16:00:52,560 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse16 (= 8 ~a17~0)) (.cse19 (= |old(~a17~0)| ~a17~0))) (let ((.cse8 (not (= ~a25~0 1))) (.cse6 (not (= ~a19~0 ~a11~0))) (.cse22 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse24 (or (not .cse16) .cse19)) (.cse25 (<= ~a17~0 8)) (.cse26 (= ~a21~0 1)) (.cse11 (not (= ~a28~0 10)))) (let ((.cse9 (= 9 ~a28~0)) (.cse13 (<= ~a28~0 7)) (.cse14 (and .cse22 .cse5 .cse24 .cse25 .cse26 .cse11)) (.cse15 (= 1 ~a11~0)) (.cse17 (= 1 ~a19~0)) (.cse7 (<= ~a19~0 0)) (.cse12 (not (= ~a28~0 9))) (.cse10 (<= ~a28~0 10)) (.cse21 (<= 9 ~a28~0)) (.cse23 (and .cse8 .cse22 .cse24 .cse25 .cse6 .cse26)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse18 (= ~a17~0 7)) (.cse0 (= 1 ~a25~0)) (.cse1 (= |old(~a17~0)| 8)) (.cse3 (= ~a17~0 |old(~a17~0)|)) (.cse4 (= 7 |old(~a28~0)|)) (.cse20 (<= ~a11~0 0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse4 .cse9 .cse6) (< 0 |old(~a11~0)|) (and .cse7 .cse8 .cse10 .cse11 .cse1 .cse3 .cse4 .cse12) (and .cse0 (and .cse1 .cse13 .cse3 .cse4 .cse14)) (and .cse15 .cse0 .cse9 .cse16 .cse17) (and (and .cse1 .cse5 .cse3 .cse4) .cse9) (and .cse1 .cse13 .cse18 .cse4 .cse14) (and (and .cse7 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4) .cse12) (not (= 1 |old(~a19~0)|)) (and .cse15 .cse0 .cse16 .cse17 (= 10 ~a28~0)) (and .cse19 .cse5 .cse20 (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (< 7 |old(~a28~0)|) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse21 .cse20 .cse12) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse18 .cse4 .cse22 .cse6 .cse11) (and .cse1 .cse18 .cse4 .cse8 .cse22 .cse5) (= |old(~a17~0)| |old(~a28~0)|) (and (and .cse1 .cse3 .cse10 (and .cse23 .cse5)) (= |old(~a28~0)| 7) .cse21) (and .cse1 .cse23 .cse2 .cse18 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse20) (< 8 |old(~a17~0)|))))) [2018-09-14 16:00:52,561 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-14 16:00:52,561 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-14 16:00:52,561 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse16 (= 8 ~a17~0)) (.cse19 (= |old(~a17~0)| ~a17~0))) (let ((.cse8 (not (= ~a25~0 1))) (.cse6 (not (= ~a19~0 ~a11~0))) (.cse22 (not (= ~a28~0 8))) (.cse5 (= ~a19~0 1)) (.cse24 (or (not .cse16) .cse19)) (.cse25 (<= ~a17~0 8)) (.cse26 (= ~a21~0 1)) (.cse11 (not (= ~a28~0 10)))) (let ((.cse9 (= 9 ~a28~0)) (.cse13 (<= ~a28~0 7)) (.cse14 (and .cse22 .cse5 .cse24 .cse25 .cse26 .cse11)) (.cse15 (= 1 ~a11~0)) (.cse17 (= 1 ~a19~0)) (.cse7 (<= ~a19~0 0)) (.cse12 (not (= ~a28~0 9))) (.cse10 (<= ~a28~0 10)) (.cse21 (<= 9 ~a28~0)) (.cse23 (and .cse8 .cse22 .cse24 .cse25 .cse6 .cse26)) (.cse2 (not (= ~a28~0 ~a17~0))) (.cse18 (= ~a17~0 7)) (.cse0 (= 1 ~a25~0)) (.cse1 (= |old(~a17~0)| 8)) (.cse3 (= ~a17~0 |old(~a17~0)|)) (.cse4 (= 7 |old(~a28~0)|)) (.cse20 (<= ~a11~0 0))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse4 .cse9 .cse6) (< 0 |old(~a11~0)|) (and .cse7 .cse8 .cse10 .cse11 .cse1 .cse3 .cse4 .cse12) (and .cse0 (and .cse1 .cse13 .cse3 .cse4 .cse14)) (and .cse15 .cse0 .cse9 .cse16 .cse17) (and (and .cse1 .cse5 .cse3 .cse4) .cse9) (and .cse1 .cse13 .cse18 .cse4 .cse14) (and (and .cse7 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4) .cse12) (not (= 1 |old(~a19~0)|)) (and .cse15 .cse0 .cse16 .cse17 (= 10 ~a28~0)) (and .cse19 .cse5 .cse20 (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (< 7 |old(~a28~0)|) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse21 .cse20 .cse12) (= 1 |old(~a25~0)|) (and .cse1 .cse2 .cse18 .cse4 .cse22 .cse6 .cse11) (and .cse1 .cse18 .cse4 .cse8 .cse22 .cse5) (= |old(~a17~0)| |old(~a28~0)|) (and (and .cse1 .cse3 .cse10 (and .cse23 .cse5)) (= |old(~a28~0)| 7) .cse21) (and .cse1 .cse23 .cse2 .cse18 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse20) (< 8 |old(~a17~0)|))))) [2018-09-14 16:00:52,561 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-14 16:00:52,561 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-14 16:00:52,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 04:00:52 BoogieIcfgContainer [2018-09-14 16:00:52,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 16:00:52,589 INFO L168 Benchmark]: Toolchain (without parser) took 66729.71 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-14 16:00:52,590 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 16:00:52,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-14 16:00:52,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 16:00:52,591 INFO L168 Benchmark]: Boogie Preprocessor took 210.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -850.2 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2018-09-14 16:00:52,592 INFO L168 Benchmark]: RCFGBuilder took 3408.87 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 93.8 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2018-09-14 16:00:52,593 INFO L168 Benchmark]: TraceAbstraction took 62301.01 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 750.3 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -182.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-14 16:00:52,600 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.19 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 727.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 210.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -850.2 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3408.87 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 93.8 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62301.01 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 750.3 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -182.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == a21) || ((((((1 == a25 && \old(a17) == 8) && !(a28 == a17)) && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && !(a19 == a11))) || ((((((a19 <= 0 && !(a25 == 1)) && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && 9 == a28) && !(a19 == a11))) || 0 < \old(a11)) || (((((((a19 <= 0 && !(a25 == 1)) && a28 <= 10) && !(a28 == 10)) && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && !(a28 == 9))) || (1 == a25 && (((\old(a17) == 8 && a28 <= 7) && a17 == \old(a17)) && 7 == \old(a28)) && ((((!(a28 == 8) && a19 == 1) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && a21 == 1) && !(a28 == 10))) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || ((((\old(a17) == 8 && a19 == 1) && a17 == \old(a17)) && 7 == \old(a28)) && 9 == a28)) || ((((\old(a17) == 8 && a28 <= 7) && a17 == 7) && 7 == \old(a28)) && ((((!(a28 == 8) && a19 == 1) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && a21 == 1) && !(a28 == 10))) || (((((((a19 <= 0 && a28 <= 10) && !(a28 == 10)) && \old(a17) == 8) && !(a28 == a17)) && a17 == \old(a17)) && 7 == \old(a28)) && !(a28 == 9))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || ((((\old(a17) == a17 && a19 == 1) && a11 <= 0) && a28 == \old(a28)) && a25 == \old(a25))) || 7 < \old(a28)) || ((((((((a19 <= 0 && 1 == a25) && a28 <= 10) && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && 9 <= a28) && a11 <= 0) && !(a28 == 9))) || 1 == \old(a25)) || ((((((\old(a17) == 8 && !(a28 == a17)) && a17 == 7) && 7 == \old(a28)) && !(a28 == 8)) && !(a19 == a11)) && !(a28 == 10))) || (((((\old(a17) == 8 && a17 == 7) && 7 == \old(a28)) && !(a25 == 1)) && !(a28 == 8)) && a19 == 1)) || \old(a17) == \old(a28)) || (((((\old(a17) == 8 && a17 == \old(a17)) && a28 <= 10) && (((((!(a25 == 1) && !(a28 == 8)) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && !(a19 == a11)) && a21 == 1) && a19 == 1) && \old(a28) == 7) && 9 <= a28)) || ((((\old(a17) == 8 && ((((!(a25 == 1) && !(a28 == 8)) && (!(8 == a17) || \old(a17) == a17)) && a17 <= 8) && !(a19 == a11)) && a21 == 1) && !(a28 == a17)) && a17 == 7) && 7 == \old(a28))) || (((((1 == a25 && \old(a17) == 8) && a17 == \old(a17)) && 7 == \old(a28)) && a19 == 1) && a11 <= 0)) || 8 < \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 62.2s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 33.5s AutomataDifference, 0.0s DeadEndRemovalTime, 11.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1355 SDtfs, 14881 SDslu, 1875 SDs, 0 SdLazy, 18238 SolverSat, 4040 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6193 GetRequests, 5964 SyntacticMatches, 30 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11584occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 4205 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 404 PreInvPairs, 514 NumberOfFragments, 1646 HoareAnnotationTreeSize, 404 FomulaSimplifications, 91202 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14919 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 5359 NumberOfCodeBlocks, 5359 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 8287 ConstructedInterpolants, 0 QuantifiedInterpolants, 3953821 SizeOfPredicates, 9 NumberOfNonLiveVariables, 7084 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 39 InterpolantComputations, 8 PerfectInterpolantSequences, 6102/6899 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_16-00-52-618.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_16-00-52-618.csv Received shutdown request...