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/Problem02_label19_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:12:53,314 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:12:53,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:12:53,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:12:53,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:12:53,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:12:53,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:12:53,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:12:53,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:12:53,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:12:53,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:12:53,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:12:53,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:12:53,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:12:53,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:12:53,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:12:53,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:12:53,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:12:53,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:12:53,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:12:53,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:12:53,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:12:53,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:12:53,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:12:53,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:12:53,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:12:53,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:12:53,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:12:53,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:12:53,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:12:53,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:12:53,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:12:53,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:12:53,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:12:53,381 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:12:53,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:12:53,382 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 17:12:53,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:12:53,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:12:53,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:12:53,413 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:12:53,413 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:12:53,413 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:12:53,414 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:12:53,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:12:53,414 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:12:53,414 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:12:53,415 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:12:53,415 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:12:53,415 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:12:53,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:12:53,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:12:53,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:12:53,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:12:53,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:12:53,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:12:53,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:12:53,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:12:53,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:12:53,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:12:53,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:12:53,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:12:53,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:12:53,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:12:53,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:12:53,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:12:53,422 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:12:53,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:12:53,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:12:53,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:12:53,423 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:12:53,423 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:12:53,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:12:53,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:12:53,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:12:53,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:12:53,499 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:12:53,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2018-11-12 17:12:53,563 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0bbc3a4/43b89fb4ba1d404282b5056b0e4a6cb8/FLAG0b58dc687 [2018-11-12 17:12:54,110 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:12:54,111 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2018-11-12 17:12:54,125 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0bbc3a4/43b89fb4ba1d404282b5056b0e4a6cb8/FLAG0b58dc687 [2018-11-12 17:12:54,150 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0bbc3a4/43b89fb4ba1d404282b5056b0e4a6cb8 [2018-11-12 17:12:54,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:12:54,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:12:54,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:12:54,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:12:54,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:12:54,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:54,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec7ce7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54, skipping insertion in model container [2018-11-12 17:12:54,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:54,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:12:54,265 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:12:54,737 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:12:54,742 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:12:54,910 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:12:54,927 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:12:54,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54 WrapperNode [2018-11-12 17:12:54,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:12:54,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:12:54,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:12:54,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:12:54,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:54,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:12:55,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:12:55,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:12:55,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:12:55,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (1/1) ... [2018-11-12 17:12:55,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:12:55,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:12:55,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:12:55,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:12:55,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (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 17:12:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:12:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:12:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:12:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:12:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:12:55,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:12:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:12:55,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:12:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:12:58,272 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:12:58,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:58 BoogieIcfgContainer [2018-11-12 17:12:58,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:12:58,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:12:58,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:12:58,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:12:58,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:12:54" (1/3) ... [2018-11-12 17:12:58,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7946fd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:58, skipping insertion in model container [2018-11-12 17:12:58,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:54" (2/3) ... [2018-11-12 17:12:58,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7946fd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:58, skipping insertion in model container [2018-11-12 17:12:58,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:58" (3/3) ... [2018-11-12 17:12:58,287 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label19_true-unreach-call_false-termination.c [2018-11-12 17:12:58,298 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:12:58,307 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:12:58,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:12:58,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:12:58,363 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:12:58,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:12:58,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:12:58,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:12:58,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:12:58,365 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:12:58,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:12:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:12:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 17:12:58,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:58,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:12:58,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:58,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 910633199, now seen corresponding path program 1 times [2018-11-12 17:12:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:58,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:58,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:58,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:59,317 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 17:12:59,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:59,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 17:12:59,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:59,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 17:12:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 17:12:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:12:59,350 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2018-11-12 17:13:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:01,806 INFO L93 Difference]: Finished difference Result 795 states and 1383 transitions. [2018-11-12 17:13:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:13:01,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-12 17:13:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:01,832 INFO L225 Difference]: With dead ends: 795 [2018-11-12 17:13:01,832 INFO L226 Difference]: Without dead ends: 552 [2018-11-12 17:13:01,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:13:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-11-12 17:13:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2018-11-12 17:13:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:13:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 639 transitions. [2018-11-12 17:13:01,930 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 639 transitions. Word has length 99 [2018-11-12 17:13:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:01,931 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 639 transitions. [2018-11-12 17:13:01,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 17:13:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 639 transitions. [2018-11-12 17:13:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-12 17:13:01,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:01,942 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:01,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:01,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1723273534, now seen corresponding path program 1 times [2018-11-12 17:13:01,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:01,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:01,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:01,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:02,298 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:13:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 17:13:02,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:02,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:02,512 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2018-11-12 17:13:02,514 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:02,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:02,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:03,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:03,398 INFO L272 AbstractInterpreter]: Visited 99 different actions 99 times. Never merged. Never widened. Performed 1575 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:13:03,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:03,449 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:04,007 INFO L227 lantSequenceWeakener]: Weakened 92 states. On average, predicates are now at 80.91% of their original sizes. [2018-11-12 17:13:04,008 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:04,807 INFO L415 sIntCurrentIteration]: We unified 107 AI predicates to 107 [2018-11-12 17:13:04,807 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:04,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:04,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-12 17:13:04,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:04,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:13:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:13:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:13:04,812 INFO L87 Difference]: Start difference. First operand 382 states and 639 transitions. Second operand 14 states. [2018-11-12 17:13:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:18,585 INFO L93 Difference]: Finished difference Result 1058 states and 1806 transitions. [2018-11-12 17:13:18,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:13:18,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2018-11-12 17:13:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:18,591 INFO L225 Difference]: With dead ends: 1058 [2018-11-12 17:13:18,591 INFO L226 Difference]: Without dead ends: 682 [2018-11-12 17:13:18,596 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 120 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:13:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-12 17:13:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 529. [2018-11-12 17:13:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-12 17:13:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 794 transitions. [2018-11-12 17:13:18,647 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 794 transitions. Word has length 108 [2018-11-12 17:13:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:18,647 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 794 transitions. [2018-11-12 17:13:18,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:13:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 794 transitions. [2018-11-12 17:13:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 17:13:18,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:18,655 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:18,655 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:18,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -212564618, now seen corresponding path program 1 times [2018-11-12 17:13:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:18,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:19,275 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 17:13:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:19,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:19,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:19,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-11-12 17:13:19,573 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:19,579 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:19,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:20,072 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:20,072 INFO L272 AbstractInterpreter]: Visited 102 different actions 200 times. Merged at 5 different actions 7 times. Never widened. Performed 2899 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2899 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:13:20,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:20,111 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:20,472 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 83.33% of their original sizes. [2018-11-12 17:13:20,472 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:21,412 INFO L415 sIntCurrentIteration]: We unified 112 AI predicates to 112 [2018-11-12 17:13:21,413 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-12 17:13:21,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:21,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:13:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:13:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:13:21,415 INFO L87 Difference]: Start difference. First operand 529 states and 794 transitions. Second operand 12 states. [2018-11-12 17:13:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:41,350 INFO L93 Difference]: Finished difference Result 1794 states and 2744 transitions. [2018-11-12 17:13:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:13:41,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-11-12 17:13:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:41,358 INFO L225 Difference]: With dead ends: 1794 [2018-11-12 17:13:41,358 INFO L226 Difference]: Without dead ends: 1271 [2018-11-12 17:13:41,361 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:13:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-11-12 17:13:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1122. [2018-11-12 17:13:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-11-12 17:13:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1500 transitions. [2018-11-12 17:13:41,408 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1500 transitions. Word has length 113 [2018-11-12 17:13:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:41,408 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 1500 transitions. [2018-11-12 17:13:41,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:13:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1500 transitions. [2018-11-12 17:13:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-12 17:13:41,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:41,413 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:41,413 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:41,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1615042339, now seen corresponding path program 1 times [2018-11-12 17:13:41,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:41,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:41,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:41,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:41,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:41,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:41,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2018-11-12 17:13:41,595 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:41,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:41,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:42,048 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:42,049 INFO L272 AbstractInterpreter]: Visited 103 different actions 302 times. Merged at 7 different actions 15 times. Never widened. Performed 4715 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4715 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:13:42,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:42,053 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:42,264 INFO L227 lantSequenceWeakener]: Weakened 115 states. On average, predicates are now at 80.61% of their original sizes. [2018-11-12 17:13:42,265 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:42,375 INFO L415 sIntCurrentIteration]: We unified 117 AI predicates to 117 [2018-11-12 17:13:42,375 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:42,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:13:42,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:42,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:42,377 INFO L87 Difference]: Start difference. First operand 1122 states and 1500 transitions. Second operand 11 states. [2018-11-12 17:13:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:51,747 INFO L93 Difference]: Finished difference Result 3234 states and 4800 transitions. [2018-11-12 17:13:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:13:51,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-12 17:13:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:51,758 INFO L225 Difference]: With dead ends: 3234 [2018-11-12 17:13:51,759 INFO L226 Difference]: Without dead ends: 2417 [2018-11-12 17:13:51,763 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:13:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2018-11-12 17:13:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2238. [2018-11-12 17:13:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2018-11-12 17:13:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 2809 transitions. [2018-11-12 17:13:51,834 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 2809 transitions. Word has length 118 [2018-11-12 17:13:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:51,835 INFO L480 AbstractCegarLoop]: Abstraction has 2238 states and 2809 transitions. [2018-11-12 17:13:51,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 2809 transitions. [2018-11-12 17:13:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-12 17:13:51,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:51,840 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:51,840 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:51,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2089420970, now seen corresponding path program 1 times [2018-11-12 17:13:51,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:51,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:13:52,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:52,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:52,058 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-11-12 17:13:52,058 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:52,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:52,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:52,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:52,830 INFO L272 AbstractInterpreter]: Visited 104 different actions 519 times. Merged at 8 different actions 43 times. Widened at 1 different actions 1 times. Performed 7095 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7095 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:52,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:52,837 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:53,080 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 80.65% of their original sizes. [2018-11-12 17:13:53,081 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:53,365 INFO L415 sIntCurrentIteration]: We unified 131 AI predicates to 131 [2018-11-12 17:13:53,365 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:53,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:53,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:13:53,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:53,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:53,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:53,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:53,368 INFO L87 Difference]: Start difference. First operand 2238 states and 2809 transitions. Second operand 11 states. [2018-11-12 17:14:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:00,509 INFO L93 Difference]: Finished difference Result 4965 states and 6579 transitions. [2018-11-12 17:14:00,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 17:14:00,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2018-11-12 17:14:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:00,534 INFO L225 Difference]: With dead ends: 4965 [2018-11-12 17:14:00,541 INFO L226 Difference]: Without dead ends: 3036 [2018-11-12 17:14:00,551 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:14:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2018-11-12 17:14:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2987. [2018-11-12 17:14:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2018-11-12 17:14:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3720 transitions. [2018-11-12 17:14:00,648 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3720 transitions. Word has length 132 [2018-11-12 17:14:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:00,649 INFO L480 AbstractCegarLoop]: Abstraction has 2987 states and 3720 transitions. [2018-11-12 17:14:00,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:14:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3720 transitions. [2018-11-12 17:14:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-12 17:14:00,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:00,656 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:00,656 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:00,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1311860951, now seen corresponding path program 1 times [2018-11-12 17:14:00,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:00,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:00,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:00,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 17:14:01,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:01,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:01,343 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-12 17:14:01,344 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:01,347 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:01,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:01,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:01,859 INFO L272 AbstractInterpreter]: Visited 105 different actions 308 times. Merged at 7 different actions 17 times. Never widened. Performed 4497 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:01,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:01,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:01,864 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 17:14:01,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:01,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:01,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:02,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:03,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:03,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2018-11-12 17:14:03,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:03,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:14:03,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:14:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:14:03,097 INFO L87 Difference]: Start difference. First operand 2987 states and 3720 transitions. Second operand 11 states. [2018-11-12 17:14:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:10,662 INFO L93 Difference]: Finished difference Result 7906 states and 11201 transitions. [2018-11-12 17:14:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:14:10,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2018-11-12 17:14:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:10,688 INFO L225 Difference]: With dead ends: 7906 [2018-11-12 17:14:10,688 INFO L226 Difference]: Without dead ends: 4576 [2018-11-12 17:14:10,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 305 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 17:14:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2018-11-12 17:14:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4138. [2018-11-12 17:14:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4138 states. [2018-11-12 17:14:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 5068 transitions. [2018-11-12 17:14:10,831 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 5068 transitions. Word has length 147 [2018-11-12 17:14:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:10,832 INFO L480 AbstractCegarLoop]: Abstraction has 4138 states and 5068 transitions. [2018-11-12 17:14:10,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:14:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 5068 transitions. [2018-11-12 17:14:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 17:14:10,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:10,841 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:10,841 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:10,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:10,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1009639280, now seen corresponding path program 1 times [2018-11-12 17:14:10,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:10,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:10,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:10,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:10,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:10,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:10,965 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-11-12 17:14:10,965 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:10,967 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:10,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:11,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:11,489 INFO L272 AbstractInterpreter]: Visited 104 different actions 305 times. Merged at 7 different actions 17 times. Never widened. Performed 4456 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4456 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:11,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:11,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:11,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:11,500 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:11,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:11,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:11,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:11,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:11,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-12 17:14:11,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:11,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:14:11,823 INFO L87 Difference]: Start difference. First operand 4138 states and 5068 transitions. Second operand 6 states. [2018-11-12 17:14:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:13,656 INFO L93 Difference]: Finished difference Result 9168 states and 11449 transitions. [2018-11-12 17:14:13,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 17:14:13,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-12 17:14:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:13,687 INFO L225 Difference]: With dead ends: 9168 [2018-11-12 17:14:13,687 INFO L226 Difference]: Without dead ends: 5183 [2018-11-12 17:14:13,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:14:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2018-11-12 17:14:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5053. [2018-11-12 17:14:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5053 states. [2018-11-12 17:14:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 5053 states and 6046 transitions. [2018-11-12 17:14:13,839 INFO L78 Accepts]: Start accepts. Automaton has 5053 states and 6046 transitions. Word has length 149 [2018-11-12 17:14:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:13,840 INFO L480 AbstractCegarLoop]: Abstraction has 5053 states and 6046 transitions. [2018-11-12 17:14:13,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5053 states and 6046 transitions. [2018-11-12 17:14:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-12 17:14:13,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:13,851 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:13,851 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:13,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -728159939, now seen corresponding path program 1 times [2018-11-12 17:14:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:13,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:13,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:14,051 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 17:14:14,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:14,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:14,225 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-11-12 17:14:14,225 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:14,228 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:14,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:14,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:14,699 INFO L272 AbstractInterpreter]: Visited 105 different actions 315 times. Merged at 8 different actions 24 times. Never widened. Performed 4436 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4436 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:14,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:14,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:14,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:14,709 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:14,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:14,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:14,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-12 17:14:14,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 17:14:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:14,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-12 17:14:14,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:14,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:14:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:14:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:14:14,966 INFO L87 Difference]: Start difference. First operand 5053 states and 6046 transitions. Second operand 8 states. [2018-11-12 17:14:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:18,201 INFO L93 Difference]: Finished difference Result 19308 states and 24025 transitions. [2018-11-12 17:14:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 17:14:18,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 162 [2018-11-12 17:14:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:18,263 INFO L225 Difference]: With dead ends: 19308 [2018-11-12 17:14:18,263 INFO L226 Difference]: Without dead ends: 14550 [2018-11-12 17:14:18,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:14:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14550 states. [2018-11-12 17:14:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14550 to 13854. [2018-11-12 17:14:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13854 states. [2018-11-12 17:14:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 16330 transitions. [2018-11-12 17:14:18,673 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 16330 transitions. Word has length 162 [2018-11-12 17:14:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:18,673 INFO L480 AbstractCegarLoop]: Abstraction has 13854 states and 16330 transitions. [2018-11-12 17:14:18,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:14:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 16330 transitions. [2018-11-12 17:14:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 17:14:18,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:18,693 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:18,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:18,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash -156598572, now seen corresponding path program 1 times [2018-11-12 17:14:18,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:18,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:18,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:18,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:18,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:18,967 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 86 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-12 17:14:19,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:19,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:19,385 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-11-12 17:14:19,385 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:19,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:19,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:19,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:19,818 INFO L272 AbstractInterpreter]: Visited 105 different actions 318 times. Merged at 8 different actions 27 times. Never widened. Performed 3914 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3914 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:19,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:19,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:19,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:19,828 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:19,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:19,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:20,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:20,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:20,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-12 17:14:20,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:20,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:14:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:14:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:14:20,201 INFO L87 Difference]: Start difference. First operand 13854 states and 16330 transitions. Second operand 11 states. [2018-11-12 17:14:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:22,301 INFO L93 Difference]: Finished difference Result 22846 states and 26990 transitions. [2018-11-12 17:14:22,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:14:22,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2018-11-12 17:14:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:22,343 INFO L225 Difference]: With dead ends: 22846 [2018-11-12 17:14:22,343 INFO L226 Difference]: Without dead ends: 12876 [2018-11-12 17:14:22,367 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 342 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:14:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12876 states. [2018-11-12 17:14:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12876 to 12594. [2018-11-12 17:14:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12594 states. [2018-11-12 17:14:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12594 states to 12594 states and 14701 transitions. [2018-11-12 17:14:22,631 INFO L78 Accepts]: Start accepts. Automaton has 12594 states and 14701 transitions. Word has length 170 [2018-11-12 17:14:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 12594 states and 14701 transitions. [2018-11-12 17:14:22,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:14:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12594 states and 14701 transitions. [2018-11-12 17:14:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-12 17:14:22,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:22,654 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:14:22,654 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:22,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1054929723, now seen corresponding path program 1 times [2018-11-12 17:14:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:22,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-12 17:14:23,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:23,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:23,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-12 17:14:23,051 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [163], [166], [170], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:23,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:23,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:23,570 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:23,571 INFO L272 AbstractInterpreter]: Visited 106 different actions 310 times. Merged at 7 different actions 15 times. Never widened. Performed 4936 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4936 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:14:23,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:23,581 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:23,863 INFO L227 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 80.72% of their original sizes. [2018-11-12 17:14:23,864 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:23,975 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-12 17:14:23,975 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:23,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-11-12 17:14:23,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:23,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:14:23,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:14:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:14:23,977 INFO L87 Difference]: Start difference. First operand 12594 states and 14701 transitions. Second operand 12 states. [2018-11-12 17:14:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:33,303 INFO L93 Difference]: Finished difference Result 29037 states and 34419 transitions. [2018-11-12 17:14:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 17:14:33,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 192 [2018-11-12 17:14:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:33,346 INFO L225 Difference]: With dead ends: 29037 [2018-11-12 17:14:33,346 INFO L226 Difference]: Without dead ends: 16906 [2018-11-12 17:14:33,370 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 17:14:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16906 states. [2018-11-12 17:14:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16906 to 16031. [2018-11-12 17:14:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16031 states. [2018-11-12 17:14:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16031 states to 16031 states and 18140 transitions. [2018-11-12 17:14:33,702 INFO L78 Accepts]: Start accepts. Automaton has 16031 states and 18140 transitions. Word has length 192 [2018-11-12 17:14:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 16031 states and 18140 transitions. [2018-11-12 17:14:33,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:14:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 16031 states and 18140 transitions. [2018-11-12 17:14:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-12 17:14:33,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:33,733 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:14:33,734 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:33,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash 812342500, now seen corresponding path program 1 times [2018-11-12 17:14:33,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:33,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:33,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:33,991 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 17:14:34,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:34,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:34,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-12 17:14:34,356 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:34,359 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:34,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:34,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:34,928 INFO L272 AbstractInterpreter]: Visited 105 different actions 410 times. Merged at 8 different actions 26 times. Never widened. Performed 5634 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5634 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:14:34,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:34,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:34,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:34,934 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:34,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:35,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-12 17:14:35,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 119 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 17:14:35,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:35,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:14:35,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:35,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:14:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:14:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:14:35,354 INFO L87 Difference]: Start difference. First operand 16031 states and 18140 transitions. Second operand 9 states. [2018-11-12 17:14:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:37,570 INFO L93 Difference]: Finished difference Result 29649 states and 33837 transitions. [2018-11-12 17:14:37,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 17:14:37,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2018-11-12 17:14:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:37,591 INFO L225 Difference]: With dead ends: 29649 [2018-11-12 17:14:37,591 INFO L226 Difference]: Without dead ends: 8903 [2018-11-12 17:14:37,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:14:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2018-11-12 17:14:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 8331. [2018-11-12 17:14:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8331 states. [2018-11-12 17:14:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8331 states to 8331 states and 9004 transitions. [2018-11-12 17:14:37,793 INFO L78 Accepts]: Start accepts. Automaton has 8331 states and 9004 transitions. Word has length 214 [2018-11-12 17:14:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:37,793 INFO L480 AbstractCegarLoop]: Abstraction has 8331 states and 9004 transitions. [2018-11-12 17:14:37,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:14:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8331 states and 9004 transitions. [2018-11-12 17:14:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-12 17:14:37,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:37,805 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:37,806 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:37,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1600648944, now seen corresponding path program 1 times [2018-11-12 17:14:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:37,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:37,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-12 17:14:38,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:38,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:38,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-12 17:14:38,145 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:38,147 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:38,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:39,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:39,084 INFO L272 AbstractInterpreter]: Visited 108 different actions 431 times. Merged at 9 different actions 39 times. Widened at 1 different actions 1 times. Performed 5413 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5413 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:39,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:39,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:39,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:39,122 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:39,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:39,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:39,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-12 17:14:39,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-12 17:14:39,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:39,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-12 17:14:39,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:39,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:39,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:39,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:14:39,409 INFO L87 Difference]: Start difference. First operand 8331 states and 9004 transitions. Second operand 6 states. [2018-11-12 17:14:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:40,317 INFO L93 Difference]: Finished difference Result 14675 states and 15890 transitions. [2018-11-12 17:14:40,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:14:40,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2018-11-12 17:14:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:40,333 INFO L225 Difference]: With dead ends: 14675 [2018-11-12 17:14:40,334 INFO L226 Difference]: Without dead ends: 6954 [2018-11-12 17:14:40,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 485 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:14:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6954 states. [2018-11-12 17:14:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6954 to 5782. [2018-11-12 17:14:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5782 states. [2018-11-12 17:14:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6167 transitions. [2018-11-12 17:14:40,454 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6167 transitions. Word has length 242 [2018-11-12 17:14:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:40,455 INFO L480 AbstractCegarLoop]: Abstraction has 5782 states and 6167 transitions. [2018-11-12 17:14:40,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6167 transitions. [2018-11-12 17:14:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-12 17:14:40,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:40,464 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:14:40,464 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2010627505, now seen corresponding path program 1 times [2018-11-12 17:14:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:40,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:40,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:40,839 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 17:14:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 226 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:41,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:41,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:41,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-11-12 17:14:41,288 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [190], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [463], [465], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:41,290 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:41,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:41,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:41,890 INFO L272 AbstractInterpreter]: Visited 105 different actions 414 times. Merged at 8 different actions 30 times. Never widened. Performed 5912 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5912 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:41,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:41,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:41,899 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:41,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:41,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:41,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-12 17:14:42,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-12 17:14:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:42,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [14] total 15 [2018-11-12 17:14:42,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:42,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:14:42,604 INFO L87 Difference]: Start difference. First operand 5782 states and 6167 transitions. Second operand 3 states. [2018-11-12 17:14:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:43,283 INFO L93 Difference]: Finished difference Result 8062 states and 8559 transitions. [2018-11-12 17:14:43,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:43,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-11-12 17:14:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:43,284 INFO L225 Difference]: With dead ends: 8062 [2018-11-12 17:14:43,284 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:14:43,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:14:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:14:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:14:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:14:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:14:43,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-11-12 17:14:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:43,297 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:14:43,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:14:43,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:14:43,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:14:43,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:44,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:44,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:44,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:44,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:44,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:44,764 WARN L179 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 267 [2018-11-12 17:14:45,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:45,537 WARN L179 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 290 [2018-11-12 17:14:46,477 WARN L179 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-12 17:14:46,822 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 77 [2018-11-12 17:14:55,378 WARN L179 SmtUtils]: Spent 8.53 s on a formula simplification. DAG size of input: 413 DAG size of output: 124 [2018-11-12 17:14:57,117 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 292 DAG size of output: 120 [2018-11-12 17:14:58,748 WARN L179 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 312 DAG size of output: 118 [2018-11-12 17:14:58,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:14:58,751 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-12 17:14:58,751 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:14:58,751 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,751 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,751 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,751 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:14:58,752 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,753 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:14:58,754 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:14:58,755 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:14:58,756 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,757 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:14:58,758 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,759 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:14:58,760 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:14:58,761 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:14:58,762 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:14:58,763 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,764 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:14:58,765 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:14:58,766 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:14:58,767 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,768 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,768 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,768 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse33 (= 1 |old(~a25~0)|))) (let ((.cse13 (< 10 |old(~a28~0)|)) (.cse29 (< |old(~a11~0)| 0)) (.cse30 (< 1 |old(~a25~0)|)) (.cse31 (< |old(~a25~0)| 0)) (.cse9 (not (= 1 ~a21~0))) (.cse10 (not (= 1 |old(~a19~0)|))) (.cse2 (not (= 0 |old(~a11~0)|))) (.cse12 (not (= 8 |old(~a17~0)|))) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse6 (not .cse33)) (.cse22 (<= ~a17~0 |old(~a17~0)|)) (.cse26 (= |old(~a19~0)| ~a19~0)) (.cse18 (= |old(~a28~0)| ~a28~0)) (.cse1 (= ~a11~0 0)) (.cse19 (= ~a17~0 8)) (.cse20 (= ~a19~0 |old(~a19~0)|)) (.cse21 (= ~a25~0 |old(~a25~0)|))) (let ((.cse8 (and .cse18 .cse1 .cse19 .cse20 .cse21)) (.cse5 (and .cse22 .cse18 .cse26 .cse21)) (.cse7 (< 7 |old(~a17~0)|)) (.cse27 (and .cse33 (= |old(~a19~0)| |old(~a25~0)|))) (.cse16 (= ~a11~0 1)) (.cse11 (= 10 |old(~a28~0)|)) (.cse15 (= 9 |old(~a28~0)|)) (.cse17 (not (= 1 |old(~a11~0)|))) (.cse28 (<= 0 ~a11~0)) (.cse32 (or .cse0 .cse6)) (.cse3 (and (or .cse13 .cse9 .cse29 .cse10 .cse30 (< |old(~a28~0)| 9) (< 1 |old(~a11~0)|) .cse12 .cse31) (or .cse9 (not (= 7 |old(~a28~0)|)) .cse10 .cse2 .cse12 (not (= 0 |old(~a25~0)|))))) (.cse4 (< |calculate_output_#in~input| 1)) (.cse14 (< 0 |old(~a19~0)|)) (.cse25 (< |old(~a28~0)| 10)) (.cse23 (<= 10 ~a28~0)) (.cse24 (<= ~a28~0 10))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 (not (= |old(~a19~0)| 1)) .cse6 (< |old(~a28~0)| 11) .cse7) (or .cse8 (or .cse9 .cse6 .cse10 .cse11 .cse2 .cse12)) (or .cse13 .cse9 .cse14 .cse11 .cse2 .cse8 .cse15 .cse12) (or .cse13 (or .cse6 .cse7) .cse10 (and .cse16 .cse5) .cse11 .cse15 .cse17) (or (and .cse18 .cse19 .cse20 .cse21) .cse0 .cse3 .cse4) (or (and (and .cse22 .cse23 .cse24 .cse21) .cse20) (or .cse13 .cse25) .cse10) (or (and .cse22 .cse26 (or (not (= ~a19~0 ~a25~0)) (not (= 1 ~a19~0)))) .cse27 .cse7) (or .cse0 .cse9 (and .cse18 .cse19 .cse20 .cse16 .cse21) .cse6 .cse15 .cse17 (< |old(~a28~0)| 7) .cse13 .cse10 .cse11 .cse12 .cse4) (or .cse0 (and .cse28 .cse19 (<= ~a11~0 3)) (or .cse9 .cse29 .cse30) .cse31 (< 3 |old(~a11~0)|) .cse13 .cse10 .cse25 .cse12 .cse4) (or (<= ~a11~0 1) .cse32 .cse3 .cse4) (or .cse0 .cse16 .cse17 .cse11 .cse3 .cse27 .cse4) (or .cse13 .cse14 (and .cse18 .cse22 .cse20 .cse16 .cse21) .cse11 .cse15 .cse17) (or .cse28 .cse32 .cse3 .cse4) (or .cse13 .cse9 .cse6 .cse14 .cse25 .cse2 .cse12 (and .cse1 .cse23 .cse24 .cse19 .cse20 .cse21)))))) [2018-11-12 17:14:58,768 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,768 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,768 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,769 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:14:58,770 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:14:58,771 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:14:58,772 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:14:58,773 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:14:58,774 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:14:58,774 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:14:58,774 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a11~0 0) (= ~a25~0 |old(~a25~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:14:58,774 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:14:58,774 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a19~0 1)) (.cse1 (= ~a11~0 0)) (.cse7 (= 1 ~a25~0)) (.cse4 (= ~a17~0 8)) (.cse2 (<= ~a19~0 0)) (.cse9 (= ~a11~0 1)) (.cse5 (not (= ~a28~0 9))) (.cse6 (not (= ~a28~0 10))) (.cse0 (<= ~a17~0 7)) (.cse10 (= 1 ~a19~0)) (.cse12 (<= ~a17~0 |old(~a17~0)|)) (.cse11 (<= 10 ~a28~0)) (.cse3 (<= ~a28~0 10))) (or (and (<= 11 ~a28~0) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and (and .cse7 .cse3 (and .cse4 .cse8 (<= 7 ~a28~0))) .cse9) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse9 (and .cse5 .cse0)) (not (= 21 ~u~0)) (and .cse7 .cse1 .cse10 .cse4) (or (and (<= 0 ~a25~0) (<= ~a11~0 1) .cse3 .cse4 .cse8 (<= 9 ~a28~0) (<= 0 ~a11~0) (<= ~a25~0 1)) (and .cse1 (= ~a25~0 0) .cse4 .cse8 (= ~a28~0 7))) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse4) (not (= ~z~0 26)) (and .cse12 .cse2 .cse3 .cse9 .cse5 .cse6) (not (= 0 |old(~a25~0)|)) (and .cse0 (or (not (= ~a19~0 ~a25~0)) (not .cse10))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse12 (= |old(~a19~0)| ~a19~0) .cse11 .cse3) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:14:58,774 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:14:58,775 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:14:58,775 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse7 (<= 1 main_~input~0)) (.cse8 (<= main_~input~0 6)) (.cse9 (<= 0 ~a11~0)) (.cse11 (<= ~a11~0 1)) (.cse10 (= ~a19~0 1)) (.cse1 (= ~a11~0 0)) (.cse13 (= 1 ~a25~0)) (.cse4 (= ~a17~0 8)) (.cse2 (<= ~a19~0 0)) (.cse12 (= ~a11~0 1)) (.cse5 (not (= ~a28~0 9))) (.cse6 (not (= ~a28~0 10))) (.cse0 (<= ~a17~0 7)) (.cse14 (= 1 ~a19~0)) (.cse16 (<= ~a17~0 |old(~a17~0)|)) (.cse15 (<= 10 ~a28~0)) (.cse3 (<= ~a28~0 10))) (or (and (<= 11 ~a28~0) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (and .cse7 .cse8 .cse9 (or (and .cse1 (= ~a25~0 0) .cse4 .cse10 (= ~a28~0 7)) (and (<= 0 ~a25~0) .cse3 .cse4 .cse10 (<= 9 ~a28~0) (<= ~a25~0 1))) .cse11) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse12 (and .cse5 .cse0)) (and .cse7 .cse8 .cse13 .cse3 .cse9 .cse4 .cse11 .cse10 (<= |old(~a28~0)| ~a28~0)) (not (= 21 ~u~0)) (and .cse13 .cse1 .cse14 .cse4) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse2 .cse15 .cse13 .cse3 .cse4) (not (= ~z~0 26)) (and .cse16 .cse2 .cse3 .cse12 .cse5 .cse6) (not (= 0 |old(~a25~0)|)) (and .cse0 (or (not (= ~a19~0 ~a25~0)) (not .cse14))) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse16 (= |old(~a19~0)| ~a19~0) .cse15 .cse3) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:14:58,775 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:14:58,775 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:14:58,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:14:58 BoogieIcfgContainer [2018-11-12 17:14:58,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:14:58,794 INFO L168 Benchmark]: Toolchain (without parser) took 124628.61 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 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:14:58,795 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 17:14:58,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.72 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 17:14:58,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:14:58,802 INFO L168 Benchmark]: Boogie Preprocessor took 121.68 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 17:14:58,802 INFO L168 Benchmark]: RCFGBuilder took 3097.99 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: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2018-11-12 17:14:58,804 INFO L168 Benchmark]: TraceAbstraction took 120517.54 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 17:14:58,813 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 759.72 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 124.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.68 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 3097.99 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: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120517.54 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 448]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((11 <= a28 && a17 <= 7) || (((((a11 == 0 && a19 <= 0) && a28 <= 10) && a17 == 8) && !(a28 == 9)) && !(a28 == 10))) || !(a21 == 1)) || !(y == 25)) || (((1 == a25 && a28 <= 10) && (a17 == 8 && a19 == 1) && 7 <= a28) && a11 == 1)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || (a11 == 1 && !(a28 == 9) && a17 <= 7)) || !(21 == u)) || (((1 == a25 && a11 == 0) && 1 == a19) && a17 == 8)) || (((((((0 <= a25 && a11 <= 1) && a28 <= 10) && a17 == 8) && a19 == 1) && 9 <= a28) && 0 <= a11) && a25 <= 1) || ((((a11 == 0 && a25 == 0) && a17 == 8) && a19 == 1) && a28 == 7)) || !(22 == v)) || !(\old(a11) == 0)) || (((((a11 == 0 && a19 <= 0) && 10 <= a28) && 1 == a25) && a28 <= 10) && a17 == 8)) || !(z == 26)) || (((((a17 <= \old(a17) && a19 <= 0) && a28 <= 10) && a11 == 1) && !(a28 == 9)) && !(a28 == 10))) || !(0 == \old(a25))) || (a17 <= 7 && (!(a19 == a25) || !(1 == a19)))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || (((a17 <= \old(a17) && \old(a19) == a19) && 10 <= a28) && a28 <= 10)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 120.4s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 81.0s AutomataDifference, 0.0s DeadEndRemovalTime, 15.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1981 SDtfs, 17761 SDslu, 3064 SDs, 0 SdLazy, 23556 SolverSat, 4531 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.9s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3551 GetRequests, 3291 SyntacticMatches, 15 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16031occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.3s AbstIntTime, 12 AbstIntIterations, 5 AbstIntStrong, 0.9963581618194524 AbsIntWeakeningRatio, 0.26443768996960487 AbsIntAvgWeakeningVarsNumRemoved, 26.262917933130698 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 4865 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 455 PreInvPairs, 574 NumberOfFragments, 1497 HoareAnnotationTreeSize, 455 FomulaSimplifications, 48936 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 44055 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 3418 NumberOfCodeBlocks, 3418 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4719 ConstructedInterpolants, 0 QuantifiedInterpolants, 2424440 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3432 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 27 InterpolantComputations, 3 PerfectInterpolantSequences, 3100/3328 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...