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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:33:00,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:33:00,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:33:00,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:33:00,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:33:00,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:33:00,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:33:00,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:33:00,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:33:00,134 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:33:00,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:33:00,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:33:00,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:33:00,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:33:00,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:33:00,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:33:00,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:33:00,142 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:33:00,144 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:33:00,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:33:00,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:33:00,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:33:00,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:33:00,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:33:00,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:33:00,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:33:00,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:33:00,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:33:00,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:33:00,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:33:00,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:33:00,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:33:00,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:33:00,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:33:00,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:33:00,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:33:00,160 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 18:33:00,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:33:00,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:33:00,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:33:00,190 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:33:00,190 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:33:00,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:33:00,191 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:33:00,191 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:33:00,191 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:33:00,192 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:33:00,192 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:33:00,192 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:33:00,192 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:33:00,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:33:00,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:33:00,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:33:00,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:33:00,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:33:00,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:33:00,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:33:00,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:33:00,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:33:00,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:33:00,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:33:00,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:33:00,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:33:00,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:33:00,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:33:00,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:33:00,198 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:33:00,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:33:00,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:33:00,199 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:33:00,199 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:33:00,199 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:33:00,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:33:00,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:33:00,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:33:00,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:33:00,291 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:33:00,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c [2018-11-12 18:33:00,361 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbc8acf6/ccc8c2a6f25f4d1781a027b7fb5ba544/FLAGbe6d4e753 [2018-11-12 18:33:00,928 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:33:00,929 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label35_true-unreach-call.c [2018-11-12 18:33:00,943 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbc8acf6/ccc8c2a6f25f4d1781a027b7fb5ba544/FLAGbe6d4e753 [2018-11-12 18:33:00,959 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bbc8acf6/ccc8c2a6f25f4d1781a027b7fb5ba544 [2018-11-12 18:33:00,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:33:00,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:33:00,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:33:00,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:33:00,994 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:33:00,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:33:00" (1/1) ... [2018-11-12 18:33:00,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3388668e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:00, skipping insertion in model container [2018-11-12 18:33:01,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:33:00" (1/1) ... [2018-11-12 18:33:01,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:33:01,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:33:01,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:33:01,583 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:33:01,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:33:01,735 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:33:01,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01 WrapperNode [2018-11-12 18:33:01,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:33:01,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:33:01,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:33:01,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:33:01,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:33:01,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:33:01,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:33:01,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:33:01,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (1/1) ... [2018-11-12 18:33:01,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:33:01,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:33:01,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:33:01,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:33:01,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (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-11-12 18:33:02,038 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:33:02,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:33:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:33:02,039 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:33:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:33:02,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:33:02,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:33:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:33:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:33:05,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:33:05,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:33:05 BoogieIcfgContainer [2018-11-12 18:33:05,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:33:05,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:33:05,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:33:05,127 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:33:05,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:33:00" (1/3) ... [2018-11-12 18:33:05,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4350ad81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:33:05, skipping insertion in model container [2018-11-12 18:33:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:33:01" (2/3) ... [2018-11-12 18:33:05,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4350ad81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:33:05, skipping insertion in model container [2018-11-12 18:33:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:33:05" (3/3) ... [2018-11-12 18:33:05,131 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label35_true-unreach-call.c [2018-11-12 18:33:05,142 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:33:05,152 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:33:05,171 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:33:05,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:33:05,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:33:05,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:33:05,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:33:05,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:33:05,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:33:05,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:33:05,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:33:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 18:33:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-12 18:33:05,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:05,259 INFO L375 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] [2018-11-12 18:33:05,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:05,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:05,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1718908404, now seen corresponding path program 1 times [2018-11-12 18:33:05,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:05,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:05,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:05,837 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:33:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:33:05,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:33:05,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:33:05,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:05,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:33:05,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:33:05,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:33:05,992 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 18:33:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:07,502 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 18:33:07,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:33:07,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-12 18:33:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:07,525 INFO L225 Difference]: With dead ends: 574 [2018-11-12 18:33:07,525 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 18:33:07,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:33:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 18:33:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 18:33:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 18:33:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-12 18:33:07,610 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 58 [2018-11-12 18:33:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:07,610 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-12 18:33:07,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:33:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-12 18:33:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-12 18:33:07,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:07,620 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 18:33:07,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:07,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2064846773, now seen corresponding path program 1 times [2018-11-12 18:33:07,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:07,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:33:07,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:33:07,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 18:33:07,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:07,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 18:33:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 18:33:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 18:33:07,873 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-12 18:33:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:10,420 INFO L93 Difference]: Finished difference Result 1287 states and 2312 transitions. [2018-11-12 18:33:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 18:33:10,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-12 18:33:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:10,438 INFO L225 Difference]: With dead ends: 1287 [2018-11-12 18:33:10,438 INFO L226 Difference]: Without dead ends: 937 [2018-11-12 18:33:10,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:33:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-11-12 18:33:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 924. [2018-11-12 18:33:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-12 18:33:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1441 transitions. [2018-11-12 18:33:10,513 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1441 transitions. Word has length 141 [2018-11-12 18:33:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:10,514 INFO L480 AbstractCegarLoop]: Abstraction has 924 states and 1441 transitions. [2018-11-12 18:33:10,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 18:33:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1441 transitions. [2018-11-12 18:33:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-12 18:33:10,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:10,522 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 18:33:10,522 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:10,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1308524843, now seen corresponding path program 1 times [2018-11-12 18:33:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:10,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:10,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:10,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:10,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:33:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:33:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:33:10,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:10,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:33:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:33:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:33:10,836 INFO L87 Difference]: Start difference. First operand 924 states and 1441 transitions. Second operand 6 states. [2018-11-12 18:33:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:14,532 INFO L93 Difference]: Finished difference Result 2533 states and 4079 transitions. [2018-11-12 18:33:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:33:14,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-11-12 18:33:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:14,549 INFO L225 Difference]: With dead ends: 2533 [2018-11-12 18:33:14,549 INFO L226 Difference]: Without dead ends: 1615 [2018-11-12 18:33:14,557 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-11-12 18:33:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2018-11-12 18:33:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1584. [2018-11-12 18:33:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-11-12 18:33:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2317 transitions. [2018-11-12 18:33:14,632 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2317 transitions. Word has length 157 [2018-11-12 18:33:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:14,633 INFO L480 AbstractCegarLoop]: Abstraction has 1584 states and 2317 transitions. [2018-11-12 18:33:14,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:33:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2317 transitions. [2018-11-12 18:33:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-12 18:33:14,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:14,642 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 18:33:14,642 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:14,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1203673723, now seen corresponding path program 1 times [2018-11-12 18:33:14,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:14,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:14,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:14,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:14,979 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:33:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:33:15,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:33:15,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:33:15,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:15,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:33:15,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:33:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:33:15,403 INFO L87 Difference]: Start difference. First operand 1584 states and 2317 transitions. Second operand 6 states. [2018-11-12 18:33:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:17,519 INFO L93 Difference]: Finished difference Result 3504 states and 5314 transitions. [2018-11-12 18:33:17,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:33:17,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-12 18:33:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:17,534 INFO L225 Difference]: With dead ends: 3504 [2018-11-12 18:33:17,535 INFO L226 Difference]: Without dead ends: 1926 [2018-11-12 18:33:17,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:33:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-11-12 18:33:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1885. [2018-11-12 18:33:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-11-12 18:33:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2677 transitions. [2018-11-12 18:33:17,608 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2677 transitions. Word has length 181 [2018-11-12 18:33:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:17,609 INFO L480 AbstractCegarLoop]: Abstraction has 1885 states and 2677 transitions. [2018-11-12 18:33:17,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:33:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2677 transitions. [2018-11-12 18:33:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-12 18:33:17,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:17,619 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 18:33:17,619 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:17,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1057306172, now seen corresponding path program 1 times [2018-11-12 18:33:17,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:17,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:17,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:33:17,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:33:17,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:33:17,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-12 18:33:17,893 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:33:17,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:33:17,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:33:18,382 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:33:18,939 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:33:18,941 INFO L272 AbstractInterpreter]: Visited 91 different actions 260 times. Merged at 5 different actions 9 times. Never widened. Performed 2754 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2754 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:33:18,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:18,986 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:33:19,751 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 75.92% of their original sizes. [2018-11-12 18:33:19,752 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:33:21,381 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-12 18:33:21,381 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:33:21,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:33:21,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-12 18:33:21,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:21,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:33:21,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:33:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:33:21,384 INFO L87 Difference]: Start difference. First operand 1885 states and 2677 transitions. Second operand 21 states. [2018-11-12 18:33:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:55,056 INFO L93 Difference]: Finished difference Result 4586 states and 6624 transitions. [2018-11-12 18:33:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 18:33:55,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 212 [2018-11-12 18:33:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:55,071 INFO L225 Difference]: With dead ends: 4586 [2018-11-12 18:33:55,071 INFO L226 Difference]: Without dead ends: 2707 [2018-11-12 18:33:55,081 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 18:33:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2018-11-12 18:33:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2478. [2018-11-12 18:33:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2018-11-12 18:33:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3327 transitions. [2018-11-12 18:33:55,151 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3327 transitions. Word has length 212 [2018-11-12 18:33:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:55,152 INFO L480 AbstractCegarLoop]: Abstraction has 2478 states and 3327 transitions. [2018-11-12 18:33:55,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:33:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3327 transitions. [2018-11-12 18:33:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-12 18:33:55,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:55,159 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-12 18:33:55,159 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:55,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 71341271, now seen corresponding path program 1 times [2018-11-12 18:33:55,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:55,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:55,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:55,555 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:33:55,753 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 18:33:56,211 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-12 18:33:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:33:56,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:33:56,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:33:56,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-12 18:33:56,454 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:33:56,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:33:56,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:33:56,546 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:33:56,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:33:56,863 INFO L272 AbstractInterpreter]: Visited 91 different actions 516 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Performed 5874 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5874 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:33:56,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:56,890 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:33:57,172 INFO L227 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 73.49% of their original sizes. [2018-11-12 18:33:57,173 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:33:57,383 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-11-12 18:33:57,383 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:33:57,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:33:57,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-11-12 18:33:57,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:57,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 18:33:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 18:33:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:33:57,385 INFO L87 Difference]: Start difference. First operand 2478 states and 3327 transitions. Second operand 10 states. [2018-11-12 18:34:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:07,875 INFO L93 Difference]: Finished difference Result 5747 states and 8010 transitions. [2018-11-12 18:34:07,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 18:34:07,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-11-12 18:34:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:07,894 INFO L225 Difference]: With dead ends: 5747 [2018-11-12 18:34:07,894 INFO L226 Difference]: Without dead ends: 3571 [2018-11-12 18:34:07,908 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:34:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2018-11-12 18:34:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3549. [2018-11-12 18:34:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-11-12 18:34:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4671 transitions. [2018-11-12 18:34:08,009 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4671 transitions. Word has length 221 [2018-11-12 18:34:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:08,010 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 4671 transitions. [2018-11-12 18:34:08,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 18:34:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4671 transitions. [2018-11-12 18:34:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-12 18:34:08,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:08,023 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:34:08,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:08,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:08,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1459972959, now seen corresponding path program 1 times [2018-11-12 18:34:08,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:08,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:08,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:08,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:08,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:08,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:08,810 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-11-12 18:34:08,811 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:08,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:08,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:08,925 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:09,020 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:34:09,020 INFO L272 AbstractInterpreter]: Visited 124 different actions 244 times. Merged at 5 different actions 7 times. Never widened. Performed 3591 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3591 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:34:09,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:09,024 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:34:09,390 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 77.71% of their original sizes. [2018-11-12 18:34:09,391 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:34:09,815 INFO L415 sIntCurrentIteration]: We unified 256 AI predicates to 256 [2018-11-12 18:34:09,815 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:34:09,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:09,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-12 18:34:09,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 18:34:09,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 18:34:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-12 18:34:09,817 INFO L87 Difference]: Start difference. First operand 3549 states and 4671 transitions. Second operand 23 states. [2018-11-12 18:34:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:26,010 INFO L93 Difference]: Finished difference Result 8503 states and 11629 transitions. [2018-11-12 18:34:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 18:34:26,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 257 [2018-11-12 18:34:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:26,033 INFO L225 Difference]: With dead ends: 8503 [2018-11-12 18:34:26,033 INFO L226 Difference]: Without dead ends: 5256 [2018-11-12 18:34:26,049 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 281 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 18:34:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2018-11-12 18:34:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 4977. [2018-11-12 18:34:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-11-12 18:34:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6408 transitions. [2018-11-12 18:34:26,175 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6408 transitions. Word has length 257 [2018-11-12 18:34:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:26,176 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6408 transitions. [2018-11-12 18:34:26,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 18:34:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6408 transitions. [2018-11-12 18:34:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-12 18:34:26,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:26,193 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-12 18:34:26,193 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:26,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:26,193 INFO L82 PathProgramCache]: Analyzing trace with hash 448502676, now seen corresponding path program 1 times [2018-11-12 18:34:26,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:26,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:26,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:26,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:26,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:26,554 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 18:34:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 229 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:34:26,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:26,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:26,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-11-12 18:34:26,933 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:26,937 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:26,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:26,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:27,214 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:34:27,214 INFO L272 AbstractInterpreter]: Visited 92 different actions 451 times. Merged at 7 different actions 35 times. Widened at 1 different actions 1 times. Performed 4583 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4583 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:34:27,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:27,222 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:34:27,480 INFO L227 lantSequenceWeakener]: Weakened 291 states. On average, predicates are now at 73.33% of their original sizes. [2018-11-12 18:34:27,481 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:34:27,570 INFO L415 sIntCurrentIteration]: We unified 293 AI predicates to 293 [2018-11-12 18:34:27,571 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:34:27,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:27,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-12 18:34:27,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:27,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 18:34:27,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 18:34:27,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 18:34:27,572 INFO L87 Difference]: Start difference. First operand 4977 states and 6408 transitions. Second operand 10 states. [2018-11-12 18:34:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:33,408 INFO L93 Difference]: Finished difference Result 11838 states and 15528 transitions. [2018-11-12 18:34:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 18:34:33,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 294 [2018-11-12 18:34:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:33,439 INFO L225 Difference]: With dead ends: 11838 [2018-11-12 18:34:33,439 INFO L226 Difference]: Without dead ends: 7461 [2018-11-12 18:34:33,458 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 301 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 18:34:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-11-12 18:34:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7398. [2018-11-12 18:34:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7398 states. [2018-11-12 18:34:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7398 states to 7398 states and 9320 transitions. [2018-11-12 18:34:33,635 INFO L78 Accepts]: Start accepts. Automaton has 7398 states and 9320 transitions. Word has length 294 [2018-11-12 18:34:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:33,636 INFO L480 AbstractCegarLoop]: Abstraction has 7398 states and 9320 transitions. [2018-11-12 18:34:33,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 18:34:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 7398 states and 9320 transitions. [2018-11-12 18:34:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-12 18:34:33,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:33,657 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:33,658 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:33,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -729266625, now seen corresponding path program 1 times [2018-11-12 18:34:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:33,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:33,952 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 159 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-12 18:34:34,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:34,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:34,216 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-11-12 18:34:34,216 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:34,219 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:34,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:34,285 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:34,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:34:34,423 INFO L272 AbstractInterpreter]: Visited 92 different actions 270 times. Merged at 7 different actions 16 times. Never widened. Performed 3369 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3369 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:34:34,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:34,432 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:34:34,673 INFO L227 lantSequenceWeakener]: Weakened 296 states. On average, predicates are now at 75.6% of their original sizes. [2018-11-12 18:34:34,673 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:34:34,780 INFO L415 sIntCurrentIteration]: We unified 298 AI predicates to 298 [2018-11-12 18:34:34,781 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:34:34,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:34:34,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-12 18:34:34,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:34,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:34:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:34:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 18:34:34,783 INFO L87 Difference]: Start difference. First operand 7398 states and 9320 transitions. Second operand 11 states. [2018-11-12 18:34:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:45,101 INFO L93 Difference]: Finished difference Result 20818 states and 26944 transitions. [2018-11-12 18:34:45,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 18:34:45,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 299 [2018-11-12 18:34:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:45,153 INFO L225 Difference]: With dead ends: 20818 [2018-11-12 18:34:45,153 INFO L226 Difference]: Without dead ends: 14020 [2018-11-12 18:34:45,180 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 310 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-12 18:34:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14020 states. [2018-11-12 18:34:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14020 to 13423. [2018-11-12 18:34:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13423 states. [2018-11-12 18:34:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13423 states to 13423 states and 16789 transitions. [2018-11-12 18:34:45,450 INFO L78 Accepts]: Start accepts. Automaton has 13423 states and 16789 transitions. Word has length 299 [2018-11-12 18:34:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:45,451 INFO L480 AbstractCegarLoop]: Abstraction has 13423 states and 16789 transitions. [2018-11-12 18:34:45,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:34:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13423 states and 16789 transitions. [2018-11-12 18:34:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-12 18:34:45,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:45,481 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:34:45,482 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:45,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash 697597427, now seen corresponding path program 1 times [2018-11-12 18:34:45,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:45,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:45,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:45,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:45,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:45,766 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:34:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 159 proven. 159 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:34:45,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:45,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:34:45,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-11-12 18:34:45,904 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [365], [367], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:34:45,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:34:45,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:34:45,961 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:34:46,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:34:46,311 INFO L272 AbstractInterpreter]: Visited 98 different actions 476 times. Merged at 8 different actions 34 times. Never widened. Performed 5679 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5679 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:34:46,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:46,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:34:46,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:34:46,318 INFO L192 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-11-12 18:34:46,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:46,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:34:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:46,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:34:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 342 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-12 18:34:46,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:34:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 236 proven. 82 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 18:34:47,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:34:47,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 18:34:47,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:34:47,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:34:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:34:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 18:34:47,315 INFO L87 Difference]: Start difference. First operand 13423 states and 16789 transitions. Second operand 11 states. [2018-11-12 18:34:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:51,316 INFO L93 Difference]: Finished difference Result 23820 states and 31111 transitions. [2018-11-12 18:34:51,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 18:34:51,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 309 [2018-11-12 18:34:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:51,338 INFO L225 Difference]: With dead ends: 23820 [2018-11-12 18:34:51,338 INFO L226 Difference]: Without dead ends: 4744 [2018-11-12 18:34:51,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 625 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-12 18:34:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2018-11-12 18:34:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 3934. [2018-11-12 18:34:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3934 states. [2018-11-12 18:34:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 4622 transitions. [2018-11-12 18:34:51,488 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 4622 transitions. Word has length 309 [2018-11-12 18:34:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:51,489 INFO L480 AbstractCegarLoop]: Abstraction has 3934 states and 4622 transitions. [2018-11-12 18:34:51,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:34:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 4622 transitions. [2018-11-12 18:34:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-12 18:34:51,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:34:51,501 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 18:34:51,502 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:34:51,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:34:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1691878277, now seen corresponding path program 1 times [2018-11-12 18:34:51,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:34:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:51,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:34:51,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:34:51,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:34:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:34:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-12 18:34:52,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:34:52,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:34:52,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:52,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:34:52,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:34:52,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:34:52,152 INFO L87 Difference]: Start difference. First operand 3934 states and 4622 transitions. Second operand 4 states. [2018-11-12 18:34:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:53,042 INFO L93 Difference]: Finished difference Result 8462 states and 9978 transitions. [2018-11-12 18:34:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:34:53,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-11-12 18:34:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:53,043 INFO L225 Difference]: With dead ends: 8462 [2018-11-12 18:34:53,044 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:34:53,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:34:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:34:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:34:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:34:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:34:53,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 345 [2018-11-12 18:34:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:53,057 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:34:53,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:34:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:34:53,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:34:53,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:34:53,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:53,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,108 WARN L179 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 268 [2018-11-12 18:34:54,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:54,511 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 192 [2018-11-12 18:34:55,124 WARN L179 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-11-12 18:34:55,501 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2018-11-12 18:34:56,974 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 320 DAG size of output: 50 [2018-11-12 18:34:58,260 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 277 DAG size of output: 62 [2018-11-12 18:34:59,261 WARN L179 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 65 [2018-11-12 18:34:59,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:34:59,264 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-12 18:34:59,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:34:59,264 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,265 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-12 18:34:59,266 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-12 18:34:59,267 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-12 18:34:59,268 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-12 18:34:59,268 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-12 18:34:59,268 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 18:34:59,268 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-12 18:34:59,269 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 18:34:59,270 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,271 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 18:34:59,272 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 18:34:59,273 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-12 18:34:59,276 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 18:34:59,277 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,278 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 18:34:59,279 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,280 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,281 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-12 18:34:59,283 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-12 18:34:59,284 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-12 18:34:59,285 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-12 18:34:59,286 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-12 18:34:59,287 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 18:34:59,287 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 18:34:59,287 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 18:34:59,287 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 18:34:59,288 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 18:34:59,288 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 18:34:59,288 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-12 18:34:59,288 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-12 18:34:59,288 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse1 (= |old(~a19~0)| ~a19~0)) (.cse2 (= |old(~a10~0)| ~a10~0)) (.cse0 (= ~a1~0 |old(~a1~0)|))) (let ((.cse3 (= 3 |old(~a10~0)|)) (.cse4 (and .cse1 .cse2 .cse0)) (.cse5 (= 7 |old(~a19~0)|))) (and (or (< 6 |calculate_output_#in~input|) (< |calculate_output_#in~input| 2) (or (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (< 9 |old(~a19~0)|)) (and .cse0 .cse1 .cse2) (< |old(~a19~0)| 9)) (or .cse3 (= 4 |old(~a10~0)|) .cse4) (or (or .cse3 .cse5 (= 10 |old(~a19~0)|)) .cse4) (or .cse4 .cse5 (< 8 |old(~a19~0)|) (= 8 |old(~a19~0)|))))) [2018-11-12 18:34:59,288 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,289 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-12 18:34:59,290 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-12 18:34:59,291 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,292 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 18:34:59,293 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:59,294 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 18:34:59,295 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-12 18:34:59,296 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-12 18:34:59,296 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-12 18:34:59,296 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:34:59,296 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-12 18:34:59,296 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:34:59,296 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:34:59,296 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (and (= |old(~a10~0)| ~a10~0) (= ~a19~0 9) (= ~a1~0 23)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-12 18:34:59,297 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:34:59,297 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 3))) (.cse1 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (and (<= main_~input~0 6) (<= 9 ~a19~0) (<= ~a19~0 |old(~a19~0)|) (<= 2 main_~input~0)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (and .cse0 (not (= 4 ~a10~0))) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse1 (not (= ~a19~0 10))) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-12 18:34:59,297 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-12 18:34:59,297 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-12 18:34:59,297 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-12 18:34:59,297 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 3))) (.cse1 (not (= ~a19~0 7)))) (or (not (= |old(~a1~0)| 23)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (and .cse0 (not (= 4 ~a10~0))) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse1 (not (= ~a19~0 10))) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (not (= 3 ~inputC~0)) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-12 18:34:59,298 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:34:59,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:34:59 BoogieIcfgContainer [2018-11-12 18:34:59,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:34:59,316 INFO L168 Benchmark]: Toolchain (without parser) took 118330.36 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -520.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 18:34:59,317 INFO L168 Benchmark]: CDTParser took 0.20 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-11-12 18:34:59,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:59,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:59,320 INFO L168 Benchmark]: Boogie Preprocessor took 107.58 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 18:34:59,320 INFO L168 Benchmark]: RCFGBuilder took 3147.56 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: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:59,322 INFO L168 Benchmark]: TraceAbstraction took 114191.07 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 175.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-12 18:34:59,329 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.20 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 748.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 130.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.58 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3147.56 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: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114191.07 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 175.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 157]: 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: 582]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(a1) == 23) || !(inputF == 6)) || !(\old(a10) == 0)) || !(a12 == 0)) || (!(a10 == 3) && !(4 == a10))) || ((!(a19 == 7) && !(a19 == 8)) && a19 <= 8)) || ((!(a10 == 3) && !(a19 == 7)) && !(a19 == 10))) || !(4 == inputD)) || !(inputE == 5)) || !(14 == a4)) || !(3 == inputC)) || (a19 <= \old(a19) && 9 <= a19)) || !(2 == inputB)) || !(\old(a19) == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 114.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 91.6s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1414 SDtfs, 12016 SDslu, 2716 SDs, 0 SdLazy, 16921 SolverSat, 2713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.9s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2040 GetRequests, 1850 SyntacticMatches, 8 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13423occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9966254972298105 AbsIntWeakeningRatio, 0.1111111111111111 AbsIntAvgWeakeningVarsNumRemoved, 19.257433489827857 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 2085 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 201 PreInvPairs, 313 NumberOfFragments, 359 HoareAnnotationTreeSize, 201 FomulaSimplifications, 56350 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 31427 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2783 NumberOfCodeBlocks, 2783 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3079 ConstructedInterpolants, 0 QuantifiedInterpolants, 3063679 SizeOfPredicates, 1 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 2581/3056 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...