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_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 10:09:48,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 10:09:48,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 10:09:48,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 10:09:48,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 10:09:48,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 10:09:48,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 10:09:48,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 10:09:48,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 10:09:48,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 10:09:48,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 10:09:48,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 10:09:48,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 10:09:48,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 10:09:48,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 10:09:48,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 10:09:48,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 10:09:48,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 10:09:48,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 10:09:48,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 10:09:48,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 10:09:48,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 10:09:48,117 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 10:09:48,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 10:09:48,118 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 10:09:48,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 10:09:48,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 10:09:48,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 10:09:48,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 10:09:48,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 10:09:48,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 10:09:48,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 10:09:48,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 10:09:48,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 10:09:48,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 10:09:48,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 10:09:48,133 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-18 10:09:48,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 10:09:48,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 10:09:48,163 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 10:09:48,164 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 10:09:48,164 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 10:09:48,164 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 10:09:48,164 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 10:09:48,164 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 10:09:48,165 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 10:09:48,165 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 10:09:48,165 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 10:09:48,165 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 10:09:48,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 10:09:48,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 10:09:48,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 10:09:48,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 10:09:48,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 10:09:48,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 10:09:48,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 10:09:48,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 10:09:48,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 10:09:48,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 10:09:48,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 10:09:48,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 10:09:48,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:09:48,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 10:09:48,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 10:09:48,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 10:09:48,174 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 10:09:48,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 10:09:48,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 10:09:48,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 10:09:48,175 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 10:09:48,175 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 10:09:48,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 10:09:48,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 10:09:48,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 10:09:48,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 10:09:48,260 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 10:09:48,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-09-18 10:09:48,632 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b36af42/de25d5ec2a6840c49bb83430716df32c/FLAG8623e9179 [2018-09-18 10:09:48,908 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 10:09:48,909 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-09-18 10:09:48,930 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b36af42/de25d5ec2a6840c49bb83430716df32c/FLAG8623e9179 [2018-09-18 10:09:48,955 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b36af42/de25d5ec2a6840c49bb83430716df32c [2018-09-18 10:09:48,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 10:09:48,971 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 10:09:48,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 10:09:48,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 10:09:48,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 10:09:48,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:09:48" (1/1) ... [2018-09-18 10:09:48,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201dfe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:48, skipping insertion in model container [2018-09-18 10:09:48,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 10:09:48" (1/1) ... [2018-09-18 10:09:48,996 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 10:09:49,498 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:09:49,528 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 10:09:49,654 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 10:09:49,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49 WrapperNode [2018-09-18 10:09:49,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 10:09:49,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 10:09:49,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 10:09:49,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 10:09:49,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:49,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:49,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 10:09:49,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 10:09:49,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 10:09:49,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 10:09:50,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... [2018-09-18 10:09:50,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 10:09:50,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 10:09:50,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 10:09:50,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 10:09:50,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 10:09:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 10:09:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 10:09:50,189 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-18 10:09:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-18 10:09:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 10:09:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 10:09:50,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 10:09:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 10:09:53,786 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 10:09:53,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:09:53 BoogieIcfgContainer [2018-09-18 10:09:53,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 10:09:53,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 10:09:53,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 10:09:53,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 10:09:53,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 10:09:48" (1/3) ... [2018-09-18 10:09:53,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773b4781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:09:53, skipping insertion in model container [2018-09-18 10:09:53,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 10:09:49" (2/3) ... [2018-09-18 10:09:53,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773b4781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 10:09:53, skipping insertion in model container [2018-09-18 10:09:53,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 10:09:53" (3/3) ... [2018-09-18 10:09:53,796 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-09-18 10:09:53,807 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 10:09:53,819 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 10:09:53,877 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 10:09:53,878 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 10:09:53,878 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 10:09:53,879 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 10:09:53,879 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 10:09:53,879 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 10:09:53,879 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 10:09:53,879 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 10:09:53,879 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 10:09:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-09-18 10:09:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-18 10:09:53,922 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:09:53,923 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:09:53,925 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:09:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1195562327, now seen corresponding path program 1 times [2018-09-18 10:09:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:09:53,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:09:53,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:09:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:09:53,988 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:09:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:09:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:09:54,703 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:09:54,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 10:09:54,704 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:09:54,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:09:54,726 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:09:54,727 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:09:54,730 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-09-18 10:09:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:09:56,715 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-09-18 10:09:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:09:56,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-09-18 10:09:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:09:56,738 INFO L225 Difference]: With dead ends: 621 [2018-09-18 10:09:56,738 INFO L226 Difference]: Without dead ends: 382 [2018-09-18 10:09:56,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 10:09:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-18 10:09:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-18 10:09:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-18 10:09:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-09-18 10:09:56,834 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 117 [2018-09-18 10:09:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:09:56,835 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-09-18 10:09:56,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:09:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-09-18 10:09:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-18 10:09:56,843 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:09:56,844 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:09:56,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:09:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash -324277142, now seen corresponding path program 1 times [2018-09-18 10:09:56,845 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:09:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:09:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:09:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:09:56,847 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:09:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:09:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:09:57,205 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:09:57,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:09:57,206 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:09:57,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:09:57,208 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:09:57,208 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:09:57,209 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-09-18 10:09:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:09:58,755 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-09-18 10:09:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:09:58,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-09-18 10:09:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:09:58,763 INFO L225 Difference]: With dead ends: 903 [2018-09-18 10:09:58,763 INFO L226 Difference]: Without dead ends: 381 [2018-09-18 10:09:58,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:09:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-18 10:09:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-18 10:09:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-18 10:09:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-09-18 10:09:58,795 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 126 [2018-09-18 10:09:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:09:58,796 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-09-18 10:09:58,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:09:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-09-18 10:09:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-18 10:09:58,799 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:09:58,799 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:09:58,800 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:09:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1188045302, now seen corresponding path program 1 times [2018-09-18 10:09:58,800 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:09:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:09:58,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:09:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:09:58,802 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:09:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:09:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:09:59,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:09:59,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:09:59,354 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:09:59,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:09:59,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:09:59,356 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:09:59,356 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-09-18 10:10:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:01,086 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-09-18 10:10:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:01,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-09-18 10:10:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:01,093 INFO L225 Difference]: With dead ends: 901 [2018-09-18 10:10:01,093 INFO L226 Difference]: Without dead ends: 380 [2018-09-18 10:10:01,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-18 10:10:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-09-18 10:10:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-18 10:10:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-09-18 10:10:01,116 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 132 [2018-09-18 10:10:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:01,116 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-09-18 10:10:01,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-09-18 10:10:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-18 10:10:01,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:01,119 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:01,120 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -34077619, now seen corresponding path program 1 times [2018-09-18 10:10:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:01,122 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:01,336 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:01,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:10:01,336 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:01,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:10:01,337 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:10:01,337 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:10:01,338 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-09-18 10:10:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:05,075 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-09-18 10:10:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:10:05,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-09-18 10:10:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:05,081 INFO L225 Difference]: With dead ends: 1193 [2018-09-18 10:10:05,081 INFO L226 Difference]: Without dead ends: 819 [2018-09-18 10:10:05,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:10:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-18 10:10:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-09-18 10:10:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-09-18 10:10:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-09-18 10:10:05,133 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 140 [2018-09-18 10:10:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-09-18 10:10:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:10:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-09-18 10:10:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-18 10:10:05,137 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:05,137 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, 1, 1, 1, 1, 1] [2018-09-18 10:10:05,137 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1593443119, now seen corresponding path program 1 times [2018-09-18 10:10:05,138 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:05,139 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:05,522 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-18 10:10:05,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:05,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:10:05,523 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:05,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:05,523 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:05,524 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:05,524 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-09-18 10:10:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:06,709 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-09-18 10:10:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:06,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-09-18 10:10:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:06,724 INFO L225 Difference]: With dead ends: 1753 [2018-09-18 10:10:06,724 INFO L226 Difference]: Without dead ends: 804 [2018-09-18 10:10:06,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-09-18 10:10:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-09-18 10:10:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-09-18 10:10:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-09-18 10:10:06,761 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 142 [2018-09-18 10:10:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:06,761 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-09-18 10:10:06,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-09-18 10:10:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-18 10:10:06,765 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:06,765 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:06,765 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:06,766 INFO L82 PathProgramCache]: Analyzing trace with hash 890086741, now seen corresponding path program 1 times [2018-09-18 10:10:06,766 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:06,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:06,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:06,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:06,767 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:07,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:07,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 10:10:07,029 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:07,030 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:07,030 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:07,030 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-09-18 10:10:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:07,904 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-09-18 10:10:07,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:07,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-09-18 10:10:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:07,918 INFO L225 Difference]: With dead ends: 1747 [2018-09-18 10:10:07,918 INFO L226 Difference]: Without dead ends: 801 [2018-09-18 10:10:07,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 10:10:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-09-18 10:10:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-09-18 10:10:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-09-18 10:10:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-09-18 10:10:07,956 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 144 [2018-09-18 10:10:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:07,956 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-09-18 10:10:07,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-09-18 10:10:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-18 10:10:07,961 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:07,961 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 10:10:07,962 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash 207226461, now seen corresponding path program 1 times [2018-09-18 10:10:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:07,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:07,964 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:08,199 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:10:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:08,511 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 10:10:08,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-18 10:10:08,511 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:08,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-18 10:10:08,512 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-18 10:10:08,512 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-18 10:10:08,512 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-09-18 10:10:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:10,086 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-09-18 10:10:10,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 10:10:10,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-09-18 10:10:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:10,104 INFO L225 Difference]: With dead ends: 2381 [2018-09-18 10:10:10,105 INFO L226 Difference]: Without dead ends: 1586 [2018-09-18 10:10:10,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-18 10:10:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-09-18 10:10:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-09-18 10:10:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-09-18 10:10:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-09-18 10:10:10,168 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 148 [2018-09-18 10:10:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:10,168 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-09-18 10:10:10,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-18 10:10:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-09-18 10:10:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-18 10:10:10,176 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:10,176 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-18 10:10:10,176 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1224274575, now seen corresponding path program 1 times [2018-09-18 10:10:10,177 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:10,178 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:10,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:10,640 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:10,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:10,658 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:10,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-18 10:10:11,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-18 10:10:11,561 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:10:11,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-18 10:10:11,561 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:11,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:10:11,562 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:10:11,562 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:10:11,563 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-09-18 10:10:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:13,538 INFO L93 Difference]: Finished difference Result 4406 states and 6474 transitions. [2018-09-18 10:10:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:10:13,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-09-18 10:10:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:13,555 INFO L225 Difference]: With dead ends: 4406 [2018-09-18 10:10:13,555 INFO L226 Difference]: Without dead ends: 1398 [2018-09-18 10:10:13,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:10:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2018-09-18 10:10:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1396. [2018-09-18 10:10:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-09-18 10:10:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1807 transitions. [2018-09-18 10:10:13,622 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1807 transitions. Word has length 183 [2018-09-18 10:10:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:13,622 INFO L480 AbstractCegarLoop]: Abstraction has 1396 states and 1807 transitions. [2018-09-18 10:10:13,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:10:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1807 transitions. [2018-09-18 10:10:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-18 10:10:13,629 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:13,629 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, 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] [2018-09-18 10:10:13,629 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash 133706701, now seen corresponding path program 1 times [2018-09-18 10:10:13,630 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:13,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:13,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:13,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:13,631 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:14,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:14,117 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 10:10:14,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:14,128 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:14,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-18 10:10:14,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-18 10:10:14,466 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 10:10:14,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-09-18 10:10:14,467 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:14,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 10:10:14,467 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 10:10:14,468 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:10:14,468 INFO L87 Difference]: Start difference. First operand 1396 states and 1807 transitions. Second operand 3 states. [2018-09-18 10:10:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:15,101 INFO L93 Difference]: Finished difference Result 3410 states and 4461 transitions. [2018-09-18 10:10:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 10:10:15,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-09-18 10:10:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:15,120 INFO L225 Difference]: With dead ends: 3410 [2018-09-18 10:10:15,120 INFO L226 Difference]: Without dead ends: 2020 [2018-09-18 10:10:15,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 370 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-18 10:10:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2018-09-18 10:10:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 2018. [2018-09-18 10:10:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2018-09-18 10:10:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2514 transitions. [2018-09-18 10:10:15,186 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2514 transitions. Word has length 186 [2018-09-18 10:10:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:15,187 INFO L480 AbstractCegarLoop]: Abstraction has 2018 states and 2514 transitions. [2018-09-18 10:10:15,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 10:10:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2514 transitions. [2018-09-18 10:10:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-18 10:10:15,196 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 10:10:15,196 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-18 10:10:15,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 10:10:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1497680729, now seen corresponding path program 1 times [2018-09-18 10:10:15,197 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 10:10:15,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:15,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 10:10:15,198 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 10:10:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:15,432 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-18 10:10:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 143 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 10:10:15,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:15,537 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-18 10:10:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:15,554 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:15,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 158 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-18 10:10:15,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 158 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-18 10:10:16,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 10:10:16,278 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 10:10:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 10:10:16,295 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 10:10:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 10:10:16,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 10:10:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-18 10:10:16,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 10:10:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-09-18 10:10:16,955 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-18 10:10:16,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5, 5, 5] total 18 [2018-09-18 10:10:16,955 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 10:10:16,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 10:10:16,956 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 10:10:16,956 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-09-18 10:10:16,956 INFO L87 Difference]: Start difference. First operand 2018 states and 2514 transitions. Second operand 5 states. [2018-09-18 10:10:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 10:10:17,413 INFO L93 Difference]: Finished difference Result 3666 states and 4503 transitions. [2018-09-18 10:10:17,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 10:10:17,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2018-09-18 10:10:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 10:10:17,415 INFO L225 Difference]: With dead ends: 3666 [2018-09-18 10:10:17,416 INFO L226 Difference]: Without dead ends: 0 [2018-09-18 10:10:17,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 951 GetRequests, 929 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-09-18 10:10:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-18 10:10:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-18 10:10:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-18 10:10:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-18 10:10:17,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 235 [2018-09-18 10:10:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 10:10:17,426 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-18 10:10:17,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 10:10:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-18 10:10:17,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-18 10:10:17,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-18 10:10:17,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:17,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 10:10:18,037 WARN L178 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2018-09-18 10:10:18,160 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-09-18 10:10:18,302 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-09-18 10:10:18,305 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (or (not (= ~a17~0 9)) (= 9 |old(~a17~0)|)) (= |old(~a25~0)| ~a25~0)) [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-09-18 10:10:18,306 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 502) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-09-18 10:10:18,307 INFO L426 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-09-18 10:10:18,308 INFO L426 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,309 INFO L426 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-09-18 10:10:18,310 INFO L426 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,311 INFO L426 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-09-18 10:10:18,312 INFO L426 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-09-18 10:10:18,313 INFO L426 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-09-18 10:10:18,314 INFO L426 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,315 INFO L426 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-09-18 10:10:18,316 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-09-18 10:10:18,317 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,318 INFO L426 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-09-18 10:10:18,319 INFO L426 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-09-18 10:10:18,320 INFO L426 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,321 INFO L426 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= 1 |old(~a11~0)|)) (.cse13 (= 1 |old(~a19~0)|)) (.cse11 (= 1 |old(~a25~0)|)) (.cse15 (= |old(~a28~0)| ~a28~0)) (.cse12 (= |old(~a25~0)| ~a25~0)) (.cse16 (not (= ~a17~0 9)))) (let ((.cse9 (and .cse15 .cse12 .cse16)) (.cse1 (not .cse11)) (.cse2 (not .cse13)) (.cse8 (not (= 7 |old(~a28~0)|))) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse4 (= 1 ~a11~0)) (.cse5 (= 8 ~a17~0)) (.cse6 (= 1 ~a19~0)) (.cse7 (not .cse14)) (.cse10 (= 9 |old(~a17~0)|)) (.cse0 (not (= 1 ~a21~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (= 1 ~a25~0) (= 9 ~a28~0) .cse5 .cse6) (not (= 9 |old(~a28~0)|)) .cse7) (or .cse0 .cse8 .cse1 .cse2 .cse7 (and .cse4 (= 7 ~a17~0) .cse6) (not (= 7 |old(~a17~0)|))) (or .cse0 (< 7 |old(~a28~0)|) .cse9 .cse10) (or .cse9 .cse0 .cse10 .cse11) (or (and .cse4 .cse5 .cse6 .cse12 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse1 .cse2 .cse3 .cse7) (or .cse13 .cse0 .cse8 .cse3 (and .cse4 .cse5 (not .cse6)) .cse7 .cse11) (or .cse0 .cse14 (and .cse15 .cse12 (not (= ~a11~0 1)) .cse16) .cse10) (or .cse0 (and .cse15 (<= ~a17~0 7) .cse12) (< 7 |old(~a17~0)|))))) [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-09-18 10:10:18,322 INFO L426 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-09-18 10:10:18,323 INFO L426 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-09-18 10:10:18,324 INFO L426 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-09-18 10:10:18,325 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-09-18 10:10:18,326 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-09-18 10:10:18,327 INFO L426 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:10:18,328 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a28~0 7) (not (= ~a25~0 1)) (= ~a21~0 1) (not (= ~a11~0 1)) (not (= ~a17~0 9))) [2018-09-18 10:10:18,329 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-18 10:10:18,329 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:10:18,329 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (< 7 |old(~a28~0)|) (= 1 |old(~a11~0)|) (= 9 |old(~a17~0)|) (= 1 |old(~a25~0)|) (and (= |old(~a28~0)| ~a28~0) (= |old(~a25~0)| ~a25~0) (not (= ~a11~0 1)) (not (= ~a17~0 9)))) [2018-09-18 10:10:18,329 INFO L426 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-09-18 10:10:18,329 INFO L422 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~a17~0 9))) (.cse1 (= 8 ~a17~0)) (.cse2 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (< 7 |old(~a28~0)|) (and (not (= ~a25~0 1)) .cse0) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and (not (= ~a11~0 1)) .cse0) (and (<= ~a28~0 7) .cse0) (and .cse1 .cse2 (= 10 ~a28~0)) (and (= 9 ~a28~0) .cse1 .cse2) (= 9 |old(~a17~0)|))) [2018-09-18 10:10:18,329 INFO L426 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-09-18 10:10:18,329 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-09-18 10:10:18,330 INFO L422 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (not (= ~a17~0 9))) (.cse1 (= 8 ~a17~0)) (.cse2 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (< 7 |old(~a28~0)|) (and (not (= ~a25~0 1)) .cse0) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and (not (= ~a11~0 1)) .cse0) (and (<= ~a28~0 7) .cse0) (and .cse1 .cse2 (= 10 ~a28~0)) (and (= 9 ~a28~0) .cse1 .cse2) (= 9 |old(~a17~0)|))) [2018-09-18 10:10:18,330 INFO L426 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-09-18 10:10:18,330 INFO L426 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-09-18 10:10:18,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 10:10:18 BoogieIcfgContainer [2018-09-18 10:10:18,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 10:10:18,347 INFO L168 Benchmark]: Toolchain (without parser) took 29378.95 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -732.3 MB). Peak memory consumption was 367.7 MB. Max. memory is 7.1 GB. [2018-09-18 10:10:18,349 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:10:18,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.00 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-18 10:10:18,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.47 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-18 10:10:18,351 INFO L168 Benchmark]: Boogie Preprocessor took 278.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-09-18 10:10:18,352 INFO L168 Benchmark]: RCFGBuilder took 3676.45 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: 109.0 MB). Peak memory consumption was 109.0 MB. Max. memory is 7.1 GB. [2018-09-18 10:10:18,352 INFO L168 Benchmark]: TraceAbstraction took 24558.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 329.8 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -15.5 MB). Peak memory consumption was 314.3 MB. Max. memory is 7.1 GB. [2018-09-18 10:10:18,357 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.62 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 739.00 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 120.47 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 278.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3676.45 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: 109.0 MB). Peak memory consumption was 109.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24558.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 329.8 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -15.5 MB). Peak memory consumption was 314.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: 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) || 7 < \old(a28)) || (!(a25 == 1) && !(a17 == 9))) || a17 <= 7) || 1 == \old(a25)) || 1 == \old(a11)) || (!(a11 == 1) && !(a17 == 9))) || (a28 <= 7 && !(a17 == 9))) || ((8 == a17 && 1 == a19) && 10 == a28)) || ((9 == a28 && 8 == a17) && 1 == a19)) || 9 == \old(a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 24.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1356 SDtfs, 4374 SDslu, 806 SDs, 0 SdLazy, 6180 SolverSat, 1277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1754 GetRequests, 1685 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2018occurred 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: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 75 PreInvPairs, 119 NumberOfFragments, 444 HoareAnnotationTreeSize, 75 FomulaSimplifications, 1000 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 759 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2392 NumberOfCodeBlocks, 2392 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3213 ConstructedInterpolants, 0 QuantifiedInterpolants, 2164713 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1953 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 1425/1465 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_label51_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_10-10-18-384.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label51_true-unreach-call_false-termination.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_10-10-18-384.csv Received shutdown request...